Write a program that performs a rotational bit shift to the right for a positive integer. The user enters a number, the number of bits to shift (and, if you want, the direction of the shift, but right is enough). Example:The number 9 (in binary form 1001) when rotated to the right by 1 bit becomes 1100. Tip : A bit rotation (also known as a cyclic shift) is an operation in which the bits in a binary number are shifted a certain number of places to the right or left, with bits that "fall out" at one end being returned to the opposite end. So, start with a bit shift operation. Write a few examples on paper before programming.Tip : Use the unsigned int data type.You can get the number of bits of this data type as follows: int bit_count = sizeof (unsigned int ) * 8

Write a program that performs a rotational bit shift to the right for a positive integer. The user enters a number, the number of bits to shift (and, if you want, the direction of the shift, but right is enough).

Example:
The number 9 (in binary form 1001) when rotated to the right by 1 bit becomes 1100.

Tip : A bit rotation (also known as a cyclic shift) is an operation in which the bits in a binary number are shifted a certain number of places to the right or left, with bits that "fall out" at one end being returned to the opposite end. So, start with a bit shift operation. Write a few examples on paper before programming.
Tip : Use the unsigned int data type.
You can get the number of bits of this data type as follows: int bit_count = sizeof (unsigned int ) * 8