REMINDER: - Every recursive function must have one or more base cases, - The general (recursive) case must eventually be reduced to a base case (terminating condition), - The base case stops the...

Extracted text: REMINDER: - Every recursive function must have one or more base cases, - The general (recursive) case must eventually be reduced to a base case (terminating condition), - The base case stops the recursion, - Every recursive call has its own copy of parameters and the local variables [1), -A recursive function is a function that calls itself (5). Let a be an array of integers. Present recursive algorithms and write their C implementations to compute: the maximum (minimum) element of the array, • the sum (product) of the elements of the array, • the average of the elements of the array HINT: Use functions having the following prototypes: name_of_the_function (int al 1, int n); For example, function that computes maximum/minimum element in the array can be named as find_max()/ find min ().