$4\mathrm{.}2$ Question $4,($b$)$

With regard to worst$-$case time complexity, give an example of an array of length five that is a worst$-$case input. What is the value

of the counter at the termination of the program?

$4\mathrm{.}3$ Question $4.($c$)$

Whth regard to best$-$case complexity, give an example of an array of length five that is a best$-$case input. What is the value of the

counter at the fermination of the program?

$4\mathrm{.}4$ Question $4.($d$)$

Show that for an array of length $n,$ the inner while$-$locp will be expcuted $\frac{n}{2}(n-1)$ times in the worst case.

$4\mathrm{.}5$ Question $4.($e$)$

Based on the analysis above, or cherwise, what is the worst and best$-$case time complexity of SORT? Explain your answer.

$4\mathrm{.}6$ Question $4.($f$)$

What is the average$-$case time complexily of SORT? Explain your answer.