In C++ please!

In your book, Chapter 2, page 92, problem \#19 states: This problem considers several ways to compute xn for some n>=0. a. Write an iterative function power1 to compute xn for n>=0. b. Write a recursive function power 2 to compute xn by using the following recursive formulation: x=1xn=xxn1ifn>0 c. Write a recursive function power 3 to compute xn by using the following recursive formulation: x=1xn=(xn/2)2ifn>0andnisevenxn=x(xn/2)2ifn>0andnisodd d. How many multiplications will each of the functions power1, power2, and power3 perform when computing 332 ? 319 ? e. How many recursive calls will power 2 and power 3 make when computing 332 ? 319 ? Notes A friendly note of the algorithm. The value of x is a double and the value of n is an integer. Submission Information Name the function in part a. as power1 and save it to a file named power1.cpp. Name the function in part b. as power2 and save it to a file named power2.cpp. Name the function in part c. as power3 and save it to a file named power3.cpp. For parts d. and e. create a file called q19.txt (notice it's a text file, not a .cpp) and type detailed solutions. Save all the files in HW04 directory. Let me know if you have any questions