(Solved): ALGORITHM:partition(data[0:n-1], from, to) \{arranges (partitions) the elements of the subarray d ...

ALGORITHM:partition(data[0:n-1], from, to) \{arranges (partitions) the elements of the subarray data[from:to] such that all the entries from data[from:p] are less than or equal to the pivot and the entries of data[p+1:to] are greater than or equal to the pivot. The pivot is data[from], the first entry of the subarray, prior to generating the partition Input: data - an array of \( \mathbf{n} \) items from - the first index of the subarray of data that is to be partitioned to - the last index of the subarray of data that is to be partitioned Output: the index p such that data[from:p] \( <= \) data[p+1:to] while data[i] \( < \) pivot do b. 2nd call to partition: from \( =\quad \) to \( =\quad \) partition index \( =\quad[5 \) points \( ] \) Contents of data after the Second Call to partition c. 3rd call to partition: from \( =\quad \) to \( =\quad \) partition index \( =\quad[5 \) points \( ] \) Contents of data after the Third Call to partition B. Give the contents of the array that is used as the argument to quickSort, from (the first index of its subarray that is to be sorted), and to (the last index of its subarray that is to be sorted) during the indicated call. a. 3rd Call to quickSort: from= to \( = \) [5 points] Contents of data Used as the Argument to quickSort