Hello anyone can help me to find big O for this algorithm please....

f=1;

x=3;

for (int i = 1; i <= n; i*=2) for (int j = 1; j <= i * i; j++) if (i % j == 0) for (int k = 1; k <= j; k++) f=f*x;

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

for (int j = 1; j <= i * i; j

++

)

if (i % j == 0)

for (int k = 1; k <= j; k++)

f=f*x;

O(n^2)

O(n^{4})