Write a recursive function power(base exponent) that when invoked returns base For example, power(3, 4) = 3 * 3 * 3 * 3 Assume that exponent is an integer greater than or equal to 1 base = base * base and the terminating condition occurs when exponent is equal to 1 because base = base the greatest common division of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function god that returns the greatest common divisor of x and y. the god of x and y is defined recursively as follows: If y is equal to 0. then god (x, y) is x; otherwise god(x, y) is god(y, x 3/2 y), where 3/2 is the remainder operator. Write a recursive function recursive Minimum that takes an integer array and the array size as arguments and returns the smallest element of the array. the function should stop processing and return when it receives an array of one element. Write the ant main(void) function as a driver program and cat the above three functions result with sample Input/Output