eed to answer (b)

t(n) = n+(n-1)+(n-2)+(n-3)+ ...... 3+2+1

closed -from is t(n) O(n^2)

1. (a) Give a recurrence relation, ti(n), that expresses the number times the array A is accessed (read/write) by a call to quickSort 1 (A) in the worst case, where n-.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 quickSort1(int [ A) 2 quickSortAux1(A, 0, A.length - 1); 4 5 private static void quickSortAux1(int [) A, int lo, int hi)l 6 if (lo