Selection Problem Input: A set A of n (distint numbers and an integer i where 1 sin Output: the i-th smallest element of A Which of the following is not true about QuickSort and QuickSelect? Select one: None of the above Quickselect iterates on one partition only while QuickSort iterates on both In both cases, the worst case occurs when each Partition call always results in a 0:n - I or 7 1:0 split. KU In both cases, the best case occurs when each Partition call always splits the array to two equal parts Both are divide-and-conquer approaches