(10 points) Suppose we use RANDOMIZED-SELECT to select the minimum element of the array A 13,2,9,0,7,5,4,8,6,1). Describe a sequence of partitions that results in a worst-case performance of RANDOMIZED-SELECT 8. (10 points) Analyze SELECT to show that if n greater than the median-of-medians x, and at least | 9. 2 140, then at leastH elements are elements are less than x 10. (10 points) Describe an O(n) algorithm (other than linear sorting algorithm) that, n, determines the k given a set S of n distinct numbers and a positive integer k numbers in S that are closest to the median of S