6. Quick Sort Quick Sort, Partition - Given an array A=[3,17,8,32,20,9,6,11,12], what is the resulting sequence of the numbers in A after making a call to partition (A, 1,9) . (Hint: Find the correct position of 12 ) - Sort the array A=[8,28,12,48,13,26] with quicksort, choosing the pivot element to be the last element of the array. - What is the best and worst running time of the quick sort