Analyze the following algorithm by computing its running time, T(n).

int function(n)

{

int s = 0;

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

{

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

{

s = s + j;

}

}

return s;

}