Show that any comparison-based algorithm for sorting can be modified to remove all duplicates without requiring any more comparisons to be performed. Show that any comparison-based algorithm for...

Show that any comparison-based algorithm for sorting can be modified to remove all duplicates without requiring any more comparisons to be performed.

Show that any comparison-based algorithm for removing duplicates from a list of values must use Ω(n log n) comparisons.