Speicified the following piece of code:
int i = 1;
int j = 4;
while (i<(n*n)&& j<(n*n*n*n))
{
if (i%3 == 0) i+=3;
else i+=4;
if (j%2 == 0) j*=4;
else j*=2;
}
Verify its time complexity in the worst case. You must display your computations.