What is the Big O notation for the worst$-$case runtime for the following code?

i $=1$

while$($i $<$ number$)$

if i $>=1$:

i $=$ i $*2$

Group of answer choices

O$($logN$)$

O$($NlogN$)$

O$($N$)$

O$($N$2)$