1. Write a recursive C++ function that returns the number of 1's in the binary representation

of N. Use the fact that this is equal to the number of 1's in the representation of N/2,

plus 1, if N is odd.

All solutions that involve code should be sent in .cpp files.Also all code submitted should have at least three test cases (Links to an external site.) for each problem(s).