What is the time function T(n) and Big-Oh, in terms of n, of the following program fragment? Justify your answer.

public static int m(int[] arr) {

int n = arr.length;

int sum = 0;

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

for(j = 0; j < i * i; j++)

for(k = 0; k < j; k++)

sum++;

return sum;

}