(10 points) Describe an O(n) time algorithm for the following problem: - Given a set S of n distinct numbers in an arbitrary order and a positive integer k(kn), find k numbers in S that are closest to the median of S. Consider S={5.2,4.7,1.0,5.0,4.9,9.0,7.0,4.8,8.0} and k=4. Then, 5.0 is the median of S, and 4.8,4.9,5.0,5.2 are the 4 numbers that are closest to 5.0