Question 3: Given an odd size array of pairwise distinct elements, the median in the number that is smaller than (n - 1)/2 of the elements and larger than (n -1)/2 elements. Say that we have an algorithm that finds the median in time O(n). Give an algorithm to find the k smallest number in time O(n)