use the code provided to answer the question please

Experiment 1 (PreLab task - to be prepared in advance) (to write a series of small complete C programs required by the task 3.1.3 in the textbook, page 126) 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, I 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 a[ ], int n): For example, function that computes maximum/minimum element in the array can be named as find_max()/ find_min(). 8 #include 9 #include 10 #include 11 #define MAXELEMENTS 5 12 #define TRUE 1 13 #define FALSE O 14 // circular Queue insertion and deletion functions 15 //created for person 16 struct person 17 { 18 int empNo; 19 char name [12]; 20 int age; 21 char gender [2];/* M=male, F=Female */ 22 }; 23 24 //the new queue, this queue takes "person" 25 struct queue 26 { 27 struct person allperson [15]; 28 int front rear; 29 }; 30 31 // the prototypes will change, input to queue is struct person, outpu 32 33 int main(void) 34 35 char operation; 36 int x; 37 struct queue a, male, female; 38 q. front = q. rear = MAXELEMENTS - 1; 39 40 struct person tenperson [10]={123, "Ahmet", 21, "", 41 234,"Sevgi", 26, "F", 128,"Osman", 18,"M", 432, "Mert", 27,"M", 42 287,"Ayse", 34,"F", 423,"Kemal", 21, "M", 634,"Lale", 16, "F". 828,"Sefer".15,"M", 252, "Meral", 27, "F", 887,"Demet", 34, "F"); do 45 46 I 44 ab5n3.cpp //loop to insert persons into the queue for(int i=0; i