consider part b) first

4. Consider the code covered in class for a recursive maxSort routine: public void maxSort(int size) {int i, t, maxPos; if (size = A[maxPos]) maxPos=i; t= A[maxPos]; A[maxPos)= A[size-1]; A[size-1] = t; maxSort(size-1); The goal in this question is to count the number of times that an access is made to an entry of A. A statement like: t= A[max Pos); counts as one array access whereas this one: A[max Pos)= A[size-1); counts as two. Define T(n) to be the number of times that an entry of A is accessed for a problem of size n. (5) Is the operation of accessing an array entry a good choice for a proxy operation to be used for measuring the time complexity of this algorithm? Justify your answer (a) (b) [5] Determine a recurrence relation for T(n). Explain where each part of your recurrence is coming from in terms of the max Sort method