If the complexity of an algorithm is big$-$O$($g$($n$)),$ this means that the worst$-$case running time is $(g(n))$ and best$-$case is big$-$o $(g(n))$

Select one:

True

False