Write a recursive function power(base, exponent) that when invoked returns base^exponent For example, power(3, 4) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equal to 1. The greatest common divisor 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 gcd of x and y is defined recursively as follows: If y is equal to 0. then gcd(x, y) is x; otherwise gcd(x. y) is gcd(y. x % y). where % is the remainder operator. Write a recursive function 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 int main(void) function as a driver program and call the above three functions result with sample Input/Output