3. P-th Bit
Write a program that prints the bit at position p of given integer. We use the standard counting: from right to left,
starting from 0.
Examples
Input Output Comments
2145
5

1 0000100001100001  1

512
0

0 0000001000000000  0

111
8

0 0000000001101111  0

255
7

1 0000000011111111  1

Hints
1. Declare three variables (n, p and bitAtPositionP).
2. Read the user input from the console.
3. Find the value of the bit at position p:
a. Shift the number p times to the right (where p is the position) by using the >> operator. In that way
the bit we want to check will be at position 0;
b. Find the bit at position 0. Use & 1 operator expression to extract the value of a bit. By using the
following formula (bitAtPositionP & 1) you check whether the bit at position 0 is equal to 1 or not. If
the bit is equal to 1 the result is 1 if the bit is not equal - the result is 0;
c. Save the result in bitAtPosition1;
4. Print the result on the console.

в такъв случай, просто:

solve = (decimal, p) => decimal >> p & 1;

ще свърши желаната работа (операндите на >> са просто цели числа, а не стринг както ти си тръгнал, то само разбира в коя бройна система са, от съответния префикс, виж numers в JS, ако са десетична си ги прави вътрешнo на двоична)

Благодаря ти!