Which of the following is not true about Quicksort and Quickselect a. None of the below choices b. Quickslect iterates on one partion while quicksort iterates on both c. In both cases, the worst case occurs when each partition call always results in a 0:n-1 or n-1:0 split d. Both uses the divide and conquer technique e. In both cases, the best case occurs when each partition call always splits the array to two equal parts