What is the value of the variable "count", as a function of "n", after running the following code fragment?
What is the order of growth? Justify your answer. Formal proof is not necessary. You can be as creative as you want to "show" your conclusion.
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++)
count++;