Design a recursive function that returns the number of $1\text{'}$s in the binary representation of an integer

N $($N $>0).$ Use the fact that this is equal to the number of $1\text{'}$s in the representation of N$/2$ plus $1,$

if N is odd. Implement your function in a C or Java program and run it on three different integers

with $5,7$ and $9($decimal$)$ digits, respectively. Check the correctness of your results.

Hand in your program, your numbers, and the computed answers.