Perform an analysis of each of the following fragments and give a bound for the running time. Not sure how to get the Theta bound for this homework question.

sum = 0;

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

for(int j = i; j >= 0; j--) //nested for loop

sum++