Please state the difference between best$-$case, average$-$case,

and worst$-$case with respect to algorithms. According to our

lessons, which of these cases are most often used to determine a

'well$-$performing algorithm'?

$(25\%)$

Give an example of functions that would belong to $O(1),$

$($for example, the equation $6n+5$ would belong to $O(n)$

time$)(25\%)$

Describe in detail the difference between While$-$loops,

Repeat$-$loops, and For$-$loops $(25\%)$

Describe the difference between big$-$Oh notation, big$-$

Omega notation, and big$-$Theta notation $(25\%)$