When sorting the following array in ascending order with quick sort:16 6 14 12 8 18 4 20 10if choosing the 4th element (i.e. 8) as the pivot, which of the following choices represents the array at one of the middle steps when partitioning the array?

Which sorting algorithm selects a pivot element and partitions the array around it?Options: Pick one correct answer from belowBubble SortMerge SortQuick SortRadix Sort

Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this: 2  5  1  7  9  12  11  10 .Which statement is correct?a.The pivot could be the 7, but it is not the 9b.The pivot is not the 7, but it could be the 9c. Neither the 7 nor the 9 is the pivot.d.The pivot could be either the 7 or the 9.

L = [20, 9, 25, 41, 3, 4, 34, 6, 23]1.Which of the following is the correct ordering for L after a single in-place run through of `quicksort` (just before the recursive call is made), using the final element as pivot ?

Consider a modification to QuickSort where each time the partition function is called, the median of the partition array is always found (in constant time) and used as the pivot. The worst-case running time for the algorithm is: Group of answer choices Θ(nlogn) Θ(n^2) Θ(n) Θ(logn)

def partition(array, low, high): pivot = array[high] i = low - 1 for j in range(low, high): if array[j] <= pivot: i += 1 array[i], array[j] = array[j], array[i] array[i+1], array[high] = array[high], array[i+1] return i+1def quicksort(array, low=0, high=None): if high is None: high = len(array) - 1 if low < high: pivot_index = partition(array, low, high) quicksort(array, low, pivot_index-1) quicksort(array, pivot_index+1, high)my_array = [64, 34, 25, 12, 22, 11, 90, 5]quicksort(my_array)print("Sorted array:", my_array)