Given a set S of n distinct integers, we want to find the k smallest in sorted order (if k = 3, the algorithm should returns 3 numbers). Given an O(n + k*log(k)) time algorithm for doing this. Be sure to proof the correctness (by Induction), and the time complexity (explains why it is O(n + k*log(k))).