In Example $4\mathrm{.}54$ we observed that the following algorithm performs n $1$

comparisons.

m $$ x$1$

for i in $\{2,3,...,$ n$\}$ do

if m $$ xi then m $$ xi

$($a$)$ Find the best$-$case number of $$ operations.

$($b$)$ Find the worst$-$case number of $$ operations.