I want to work out the Time Complexity (eg T(n) = 4Cn²+3) of the following code in terms of number of operation:

for ( int k = n; k > 1; k /= 3 ) {

for ( int i = 0; i < n; i += 2 ) {

// constant number C of operations

}

for ( int j = 2; j < n; j = ( j * j ) ) {

// constant number C of operations

}

}

Need to show working as well.