Prove that the running time of an algorithm is $($g$($n$))$ if and only if its worst$-$case running time is O$($g$($n$))$ and its best$-$case running time is $52($g$($n$)).$