f $($n$)=$ O$($g$($n$))$ implies that log$2$ f $($n$)=$ O$($log$2$ g$($n$)),$ where g$($n$)>=2$ and

f $($n$)>=1$ for all sufficiently large n$.$