Prove upper and lower bounds on running time of the following function:

public static long intervalSums(int[] A, int[][] B) {

long count = 0;

for (int i = 0; i < A.length; i++) {

for (int j = i; j < A.length; j++) {

int sum = 0;

for (int k = i; k <= j; k++) {

sum += A[k]; count += 1;

}

B[i][j] = sum;

if (j > i) B[j][i] = -1; // fill the lower "triangle" of B with -1s

}

}

return count;

}