A little help finding the complexity of time and and complexity of space

Question

int f2(int n)
{    
    int x, y, z = 0, i;

    for(x = n, i = 0; i < n; i ++, x *= n)
    {
        y = x;
        while (y > 1)
        { 
            y /= 3;
            z += y;
        }
    }
return z;
}

I get confused by the first loop and my problem is that I can’t figure out how many times the loop is executed and how x influences the code in general.

Answer 1

It's:

log₃(n) + log₃(n²) + ... + log₃(nⁿ) = log₃(n)n(n+1)/2

in short term:

n^2log(n)