What is the growth function and the Big Oh complexity of the following code segment ?

int sum = 0;

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

{

for (int j = n; j > 0; j- - )

sum ++;

for (int k = 0; k < n; k++)

sum - -;