1. Show that any comparison-based algorithm for finding the median must use at least n - 1 comparisons.
2. Show that any comparison-based algorithm for finding the second-smallest of n values can be extended to find the smallest value also, without requiring any more comparisons to be performed.
3. Show that any comparison-based algorithm for sorting can be modified to remove all duplicates without requiring any more comparisons to be performed.