C++

-

Q1. Write a recursive function count_ones(int N) that returns the number of 1 in the binary representation of N.

Note: use the algorithm of converting from decimal number to binary one.

Test cases:

a. count_ones(9) 2

b. count_ones(4) 1

c. count_ones(15) 4

-

Q2. (20 pts) Write a recursive method power(base, exponent) that, when called, returns

For example, power(3,4) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than equal to 1.

Hint: The recursion step should use the relationship

and the terminating condition occurs when exponent is equal to 1, because

baseexponent