WeirdLoop analyze

Give a tight bound $($using the big$-$theta notation$)$ on the time complexity of following method as a function

of $n.$ For simplicity, you can assume $n$ to be a power of two.

Algorithm WeIrdLoop $(n$ : integer$)$

ilarrn

while $i1$ do

for jlarr$1$ to $i$ do

klarr$1$

while $kn$ do

klarr$2k$

ilarr$\frac{i}{2}$