2. The partition (A, lo, hi, pivot) method used in this assignment works as follows. Denote by I the value of A[pivot) before the call to partition, and denote by newpivot the return value of partition. The call to partition re-arranges the elements of Allo,...,hi) so that: A[nevpivot) - I all the elements of Allo, ..., (nevpivot-1)] are S, and, all the elements of Al(newpivot+1),...,hi) are 2 You should assume that every call to partition performs on + 4 array accesses in the worst case, where n = hi - lo +1; this is the case for the code for partition you saw in COMP 2140. (a) Give a recurrence relation, ta(n), that expresses the number times the array A is accessed (read/write) by a call to quickSort(A) in the worst case, where n = A.length. Do not count the length operation on Line 2 or when the array is passed as a parameter. Include any necessary base cases in your recurrence relation. 1 public static void quickSort( int A) { 2 quickSortAux(A, 0, A.length - 1); 3 ) 4 5 private static void quickSortAux(int OA, int lo, int hi ) 6 if (lo