What is the asymptotic running time complexity of the algorithm as a function of n. i=1 while (i =1) { // Something j=j/2 } i=i+1;

What is the asymptotic running time complexity of the algorithm as a function of n.

i=1

while (i<= n) {

j=n;

while (j>=1) {

// Something

j=j/2

}

i=i+1;

}