uicksort (IS points Partition the following array, using the first element as the partition value. Write the updated array in the second set of boxes. You may use any of the partitioning schemes we discussed in class. (If you want to use the one described in the text, you may want to review the video “23DemoPartitioning.wmv”, which l’ve posted on D2L). Assume the array has already been shuffled 10 11 : 658714 8845 7 12 2 42 96 67 0 4 7 10 11 a: What is the partition index (not the value, the index)? What are the 2 sub-arrays that now need to be sorted by recursive calls to quicksort ? Be sure to write them using the notation for a half-open range. In those subsequent recursive calls, what will be the 2 partition values?