Use the three recursive functions discussed in class for raising a number to a power to compute (1.12)631. For each function, your program should print out the result of exponentiation and the number of times the function is called. Also print the average execution times. Only use the functions given bellow:

double powr(double a, int n) { if (n == 0) return 1; else return a*powr(a,n-1) } solution 2 int fpow(double a, int n) o) return 1; else A mer *** { if (n { if (n%2 0) return fpowia,n/2) fpow(a,n/2); else return a * fpow(a,n/2) 2 fpow(a,n/2); } Is it a better solution??? solution 3 int fpow(double a, int n) { if (n 0) return 1; else { b = fpow(a, n/2); if (n%2 == = 0) return b*b; } return a *b } else * b