c++ recursion functions.

1) Write a recursive function that computes x^n. n is a nonnegative integer.

[Hint: x^n can be defined by the following two equations:

x^0 = 1.0 x^n = x*x^(n-1) for n>=1

double Power(double x, unsigned int n)

2)Write a recursive version of:

double Power(double x, unsigned int n)

that works by breaking n down into halves, squaring Power(x,n/2), and multiplying by x again if n was odd.

For example: x^11=x^5*x^5*x x^10=x^5*x^5

3) Write a recursive function,

int Mult(unsigned int m, unsigned int n)

to multiply two positive integers, m and n, using only repeated addition.