Assume n is an integer that is no less than 1. Determine the time complexity function of each loop.

c)

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

for (j = 1; j <= i; j = 2 * j)

{ }

I have gotten something I believe to be the answer, which is: T(n) = 2[log₂n + 1]. However, when I test out the code in a compiler, the formula does not add up to the correct number of iterations.

If anyone could help me with this, it would be greatly appreciated.