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)

{ }

Can anyone help me with this? I have racked my brain for 2 hours and I can't seem to come up with an answer. If you could show me the process you used to get to the answer that would be greatly appreciated.

Also the answer is not in big O notation. Its just T(n), and we are trying to find a formula for the number of iterations