17. Consider a variation of QUICKSORT that chooses either the first or the last element as the pivot with equal probability of 1/2. The algorithm uses Lomuto's partition scheme and sorts an array in ascending order. Which input would cause the worst-case performance? A. An array where the bottom half and the top half are sorted separately. B. An array sorted in descending order. C. An array where the median is either the first or the last element. D. There is no specific input that can cause worst-case performance