QUICKSORT(A. p.) 1 if par 2 q - PARTITION(A, P.) 3 QUICKSORT(A. p. q-1) 4 QUICKSORT(A. q. q*1,r) PARTITION(Ap. r) 1 X=A[r] 2 i-p-1 3 for j= p to r-1 4 if All sx 5 i=i+1 6 exchange Alil with Alj] 7 exchange Ali+1] with Alr] 8 return in 1 Which input will give the worst case scenario for quick sort? Select one: a. 13.1.2.7.5,6,41 b. (1.2.3.4.5.6.71 c. 17,6,5,4,3,2,11 d. 17.5.3,2,1.4.61 e. [1.7.6.5,4,3,21