Given a "black-box" worst-case linear-time algorithm for ?nding the median, design an algorithm solving the selection problem for an arbitrary order statistic. (In other words, explain how to use the "black-box" to ?nd the k-th smallest element.) State and prove the time-complexity of your algorithm.