Which is the Θ time complexity of this pseudocode? func doSomething(n):

if (n<=1) return;

for (i=1; i<=n; i=i*2){

print("O(1)")

}

doSomething(n/4);

Select one:
a. Θ(n2)

b. Θ(log4n)

c. Θ(n2logn)

d. Θ(log2n)​