Below is the book's partition algorithm for quicksort. Trace the operation of partition(A, 1,7) on the array A below. Rem ember that in the book's pseudo code, the leftmost position in the array has index 1, and NOT Q partition(gi) for k-i 1 to j if (a[k] val f swap(a[h]a[k]) swap (aliLa[h]) return h Below, a gridfor the array has been provided for every value that the loop variable k takes on. Fill in what the array looks like at the exact moment that k takes on the value give (immediately after it is incremented and before the check for k