Rotate by n bit positions
Write a function that rotates (NOT shifts) to the right by n bit positions the bits of an unsigned char x.ie no bits are lost in this process.
Your answer should print out the result in binary form
Your output should be like this:
x = 10100111 (binary) x rotated by 3 = 11110100 (binary)