Consider an algorithm that works as follows. You select a subset S' _~ S tmiformly at random, compute the median of S', and return this as an approximate median of S. Show that there is an absolute constant c, independent of n, so that ff you apply this algorithm with a sample S' of size c, then with probability at least .99, the number returned will be a (.05)-approximate median of S. (You may consider either the version of the algorithm that constructs S' by sampling with replacement, so that an element of S can be selected multiple times, or one without replacement.)