Note: when a problem has an array of real numbers, you cannot use counting sort or radix sort.

For this problem, you are given a number t and an array A with n real numbers that are not sorted. Describe an algorithm that finds the t numbers in A that are closest to the median of A. That is, if A = {x1, . . . , xa) and xrn is the median, we want to find the t numbers xi such that |xi-Xml are the smallest. The t numbers, of course, include the median itself since m- x, m| You may assume without further explanation that the median itself can be found in (n) time. State and briefly justify the running time of your algorithm. For full credit, your algorithm should run in O(n) time