Exercise $1$: exercise $7\mathrm{.}41$ page $310[8$pts$]$

Prove that any comparison$-$based algorithm to sort $4$ elements requires $5$ comparisons.

Give an algorithm to sort $4$ elements in $5$ comparisons.