What is the time complexity of the following algorithm?

for $($int $i=N$;$i>0$; $i=\frac{i}{2})$

counter$++$;

BigO$((logN)$

BigO$($N$)$

BigO$(N^{{?}^{{?}^{?}}}2)$

BigO$(N^{{?}^{{?}^{?}}}N)$