How would I go about calculating the Big O of this function?
I am told the answer is $O(n^{12})$ but cannot determine why it is not $O(n^9)$.
public int frag (int n) {
int sum = 0;
for (int i = 0; i < n * n * n; i++)
for(int j = i * i * i; j > 0; j--)
sum = sum + 2;
return sum;
}