Number 1 and 2. This is in C language not C++

3.2 Exercises 1. Write a recursive function that computes ", called Power(x,n), where x is a float- ing point number and n is a nonnegative integer. [Hint: Power(x,n) can be defined by the following two equations: Power(x,0) = 1.0 and for n 1, Power(x,n) -x Power(x, n-1)]. 2. Write an improved recursive version of Power(x,n) that works by breaking n down into halves (where half of n = n / 2), squaring Power(xn /2), and multiply- ing by x again if n was odd. For example,x(x5)x, whereas ). Find a suitable base case to stop the recursion