When does the best case scenario for QUICK-SELECT occur? Select one: a. When the elements are always partitioned evenly O b. When the largest element is always the pivot c. When the smallest element is always the pivot d. When the median element is the first pivot e. None of the above What is the best case time complexity for QUICK-SELECT? Select one: O a a. O(n log n) b. O(na) c. O(1) d. O(log n) Oe. O(n)