c++

Short coding questions:

1. Write an iterative (with loop) function power1 to compute xⁿ for n>=0. Write the function prototype, header and body for the function. It takes two parameters x and n (both are integers) and return the value of xⁿ.

2. Write a recursive function power2 to compute xⁿ by using the following recursive formulation:

x⁰=1;

xⁿ=x*x^n-1 if n>0

3. Write a recursive function power3 to compute xⁿ by using the following recursive formulation:

x⁰=1;

xⁿ=x^n/2*x^n/2 if n>0 and n is even

xⁿ=x* x^n/2* x^n/2 if n>0 and n is odd

4. How many multiplications will each of the functions power1, power2, and power3 perform when computing 3³²? 3¹⁹?