What is the time complexity of the below algorithm:

def myFunction$(n)$:

out $=0$

$i=1$

while $i=i*2$

out $=$ out $+1O(2^n)O(n**log(n))O(log(n))O(n^2)i$ :

$i=i*2$

out $=$ out $+1$

return out

$a.O(2^n)$

$b.O(n**log(n))$

$c.$ None $of$ the Other Options

$d.O(log(n))$

$e.O(n^2)$