What is the Big$-$O time complexity of Quick Sort Algorithms if the selected pivot creates imbalanced partitions?

Group of answer choices

Same as the Merge Sort Algorithm

Same as the Insertion Sort Algorithm when the input is unsorted

Same as finding the minimum in an input array

None of the above