When does the worst case scenario for QUICK-SELECT occurs? (QUICK-SELECT is a selection algorithm to find the kth smallest element in an unordered list choosing one element as a pivot and partitioning the data in two based on the pivot. whether less than or greater than the pivot.) Select one: a When the pivot is always other the largest or smallest element, such that the element to be selected is in the bigger partition b. When the element being selected is the smallest element c. When the element being selected is the largest olomont d. When the element being selected is the median When there is an outlior element