1.2Suppose we want to create a new quicksort-inspired algorithm that has worst-case (n log n)complexity. Which of the following designs would achieve this goal?A.Before partitioning, check if the input is nearly sorted, then perform insertion sort instead.B.Only perform at most log2(n) levels of recursion, and then switch to merge sort.C.Always use the middle element in the list as the pivot instead of the last.D.Shuffle the elements in the array after each stage of partitioning.