Prove the following:

Theorem: Any Comparison based algorithm that finds the maximum of n numbers has to make n-1 comparisons in the worst case.

Use the proof for minimum, but make proper modifications by making minimum to be maximum.