I .When CAN the worst case of Quicksort occur? __(1)__
C1:Quick Sort where leftmost (or rigltmost) element is always chosen as pivot
C2: leftmost element is chosen as pivot and array is already sorted in SAME order
C3: leftmost element is chosen as pivot and array is already sorted in REVERSE order
(A)C1
(B)C2
(C) C1 and C2
(D) C2 and C3