2. For the following problems, you must use the pseudocode for QuickSort and Partition in Section 1.1 of the course note Week 4: QuickSort on canvas and the array A = [2, 4, 7, 5, 1, 9, 6]. (a) What is the value of the pivot in the call partition(A, 1, 7)? (b) What is the index of that pivot value at the end of that call to partition()? (c) On the next recursive call to Quicksort, what sub-array does partition() evaluate? (Give the indices specifying the subarray.)

pseudocode

2. For the following problems, you must use the pseudocode for QuickSort and Partition in Section 1.1 of the course note "Week 4: QuickSort" on canvas and the array A= 2,4,7,5, 1,9, 6). (a) What is the value of the pivot in the call partition(A, 1, 7)? (b) What is the index of that pivot value at the end of that call to partition(? (c) On the next recursive call to Quicksort, what sub-array does partition() evaluate? (Give the indices specifying the subarray.) Figu 18 - Che S12e 01 A // Post condition: A[left .. right] is in sorted order Quicksort (A, left,right) { if (left=1 and right =1 and right