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

Select one:

True

False