Problem
1. Write a C function that implements the binary search algorithm.
2. Write a function set bits (int x, char p, char n) that returns x with the n bits that begin at position p inverted (i.e., 1 changed to 0 and vice versa).
3. Write the function it OQ (char *cptr, long int kk) that accepts a 32-bit binary number (kk) and converts into the ASCII string that represents its value. The resultant string is to be stored in a buffer pointed by cptr. The string must be terminated by a NULL character.