Suppose we want to sort the array 10, 8, 6, 13, 9, 2, 7, 14, 12, 1, 11 using QUICK SORT, and letting the last key of the array (i.e., 11) to be the pivot. Compute the array that results after the...

Suppose we want to sort the array 10, 8, 6, 13, 9, 2, 7, 14, 12, 1, 11 using QUICK SORT, and letting the last key of the array (i.e., 11) to be the pivot. Compute the array that results after the first step of the algorithm. (You do not need to explain here the details of the step, and you only need to write the resulting array.)