What is the complexity of the below code?

int pow$($int $m,$ int $n$

int rec $=1$;

int $k=m$;

int $i=n$;

while

if $)=(1.$

$k=k$

$\frac{i}{?}=2$

$\}$

return rec

$\}$

Your answer:

$O(n^2)$

$O(logn)$

$O(nlogn)$

$O(n)$

$O(m)$