Analysis And Design Of Algorithms

stion 23 Consider the Quick sort algorithm which sorts elements in ascending order using the first element as pivot. Then which of the following input sequence will require a maximum number of comparisons when this algorithm is applied on it? yet wered sed out of ag question Select one: O a. 52 25 76 67 89 O b. 52 25 89 67 76 O c. 22 25 56 67 89 d. 22 25 76 67 50