Problem
1. Show that the probability that any given input element x belongs to more than 2logn subproblems in size group i, for randomized quick-sort, is at most 1/n2.
2. Of the n# possible inputs to a given comparison-based sorting algorithm, what is the absolute maximum number of inputs that could be sorted with just n comparisons?