Prove that the running time of an algorithm is

$$

$($

$$

$($

$$

$)$

$)$

$$if and only

if its worst

$-$

case running time is

$$

$($

$$

$($

$$

$)$

$)$

$$and best

$-$

case running

time is

$$

$($

$$

$($

$$

$)$

$)$

$.$