Given n distinct integers in an array $($you can assume they are distinct for convenience$),$ describe an algo$-$

rithm, that can find both the maximum and minimum integer using at most $3$n$/2$ comparisons $($checking

which out of two numbers is bigger is $1$ comparision$).$ You can also assume n is even. Argue why your

algorithm is correct and why it is guaranteed not to need more than $3$n$/2$ comparisons. Note that here we

care about the exact number of comparisons, not just an asymptotic bound on them.