. For each of the following code fragments, give an analysis of the running time (Big-Oh notation) (5 points each total 30 points)
a. sum = 0;
for (int i = 0; i < n; i++)
sum++;
b. sum = 0;
for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) sum++;
c. sum = 0; for (int i = 0; i < n; i++) for (int j = 0; j
sum++; sum = 0; for (int i = 0; i < n; i++) for (int j=0; j
sum++;
e. sum 0;
for (int i = 0; i < n; i++) for (int j=0;j
f. sum = 0;
for (int i = 1; i < n; i++) for (int j = 1; j
