Adversary Argument for Finding the Maximum

Prove that finding the maximum of $n$ distinct numbers requires at least $n - 1$ comparisons in the worst case. Then prove that finding both the maximum AND minimum simultaneously can be done in $\lceil 3n/2 \rceil - 2$ comparisons.