Program: NumberofOnes Recursive

Please help complete the program below in C language.

Your program is to receive a single integer, say n, from the command line that is small enough to fit into a twos complement integer.

You are to write a recursive program that will count the number of ones in the twos complement representation of the number n. Your main program should call a function.

Here is the interface to the function.

int numberofones( int n ) ;

This is similar to programming problem #7, but I want you to re-write the numberofones function using recursion rather than iteration.

15 has 4 ones in it.

-1 has 32 ones in it.

64 has 1 one in it.

You should know your powers of 2. What is 2 raised to the 11th power?