Whats the order of growth of the running time of count function ? Provide an annotated code snippet stating asymptotic runtime for various blocks (in Big-Oh notation).

public static int count(int[] a) {

int n = a.length;

int count = 0;

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

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

for (int k = j+1; k < n; k++) {

if (a[i] + a[j] + a[k] == 0) {

count++;

}

}

}

}

return count;

}