The Quick sort algorithm receives array [14, 2, 12, 16, 10, 12, 4, 0, 6, 8] as an input. The algorithm uses the last element in the input array as its pivot. The following are the two subarrays after the first call of the Partition function as implemented in the Sorting and Searching Algorithms slides: O [0, 2, 4, 6, 8] and [10, 12, 12, 14, 16] O [2, 4, 0, 6] and [12, 14, 12, 16, 10] O [2, 4, 0, 6, 8] and [12, 16, 10, 12, 14] O [6, 2, 0, 4] and [12, 16, 12, 14, 10]