Application: Problem 5t You are given following two recursive algorithms to determine maximum element in a given integer array A a) b) Write a recurrence relation for T(n) which counts number of comparisons in each algorithm Determine complexity of each growth function T(n) (you may use Master theorem if it is applicable for solution) Which algorithm is more efficient? c) int max1(int Allleft,right) //array A with size right-left+1 int max2(int A[], left, right) if(leftm2) lf(m1>m2) return m1 return m1 else else return m2 return m2 return A[left] return A[left]