PROBLEM Write a function that begins: int rotate_left (unsigned num, int n) This function should left-shift num by n positions, where the high-order bits are reintroduced as the low-order bits. Here are two examples of a circular shift operation using a short bit pattern, rather than a full integer 1000 0001 circular shift 1 yields 0000 0011 0110 1011 circular shift 3 yields 0101 1011 PROBLEM Write a function that begins: int rotate_left (unsigned num, int n) This function should left-shift num by n positions, where the high-order bits are reintroduced as the low-order bits. Here are two examples of a circular shift operation using a short bit pattern, rather than a full integer 1000 0001 circular shift 1 yields 0000 0011 0110 1011 circular shift 3 yields 0101 1011