The quick select algorithm, given the unordered list of numbers [9, 32, 16, 23, 26, 8, 20, 26, 18, 3] and a number k, returns the kth smallest item in the list. Answer the next two questions by writing a single number in the box. What is the selection for k = 8? What is the median value? Select the one true statement about the quick select algorithm. Dit does the same recursive calls as quick sort, but returns a number instead of sorting the partitions. Uit has the same complexity as an implementation that employs quick sort. Dit is a divide-and-conquer algorithm. The base case is when the partition contains the pivot