Write a C program that uses the bitwise shift operators to shift the bits to the right >> or the left >m; This shifts m bits to the right, and the m least significant bits are lost. The following statements are the same. num=num >> 3; num >> 3; Show the operation in binary by calling the following function as defined in 3.1, void to_binary(unsigned int n); The function converts decimal to binary and outputs the binary characters Two example runs of the program are as follows, Input an integer number in the range from 0 to 65535 > 565 Input the number of bits to shift > 2 Shift to the left (enter O) or right (enter 1) 0 number 0x 235 binary 0000001000110101 Left shift equals 0x 2 bits 8d4 binary 0000100011010100 Input an integer number in the range from 0 to 65535 > 8329 Input the number of bits to shift> 3 Shift to the left (enter O) or right (enter l) 1 number 0x 2089 binary 0010000010001001 Right shift equals 0x 3 bits 411 binary 0000010000010001