What is the time complexity of the QuickSort algorithm, and how does it compare to other popular sorting algorithms in terms of average and worst-case scenarios?

Computer science and engineering 

The k-Quicksort algorithm is based on the following method for pivot selection.It starts by dividing the input array into k subarrays of equal size (except possibly forthe last one) and applies the classical pivot selection method and partition function oneach subarray (pivot is first element). Then the list of k pivots is sorted using Quicksortand the median x of the k pivots is selected to be used as pivot. Then the partitionfunction is applied to place x in its final position as usual. This is repeated (recursively)until the array is sorted.Does k-Quicksort have a better worst-case running time than the classical Quicksortalgorithm?

Part (a) [1 MARK] The list below is shown after each pass of a sorting algorithm. ['M', 'A', 'D', 'E', 'B', 'F', 'C'] # initial list Which sorting algorithm is being executed? (circle one) (a) bubble sort ['A', 'D', 'E', 'B', 'F', 'C', 'M'] # after one pass ['A', 'D', 'B', 'E', 'C', 'F', 'M'] # after two ['A', 'B', 'D', 'C', 'E', 'F', 'M'] # after three ['A', 'B', 'C', 'D', 'E', 'F', 'M'] # after four (b) selection sort (c) insertion sort