3.1)

a. sum = 0;

for (int i = 0; i

sum++;

b. sum = 0;

for (int i = 0; i

for (int j = 0; j

sum++;

c. sum = 0;

for (int i = 0; i

for (int j = 0; j

sum++;

d. sum = 0;

for (int i = 0; i

for (int j = 0; j

sum++;

e. sum 0;

for (int i = 0; i

for (int j = 0; j

for (int k = 0; k

sum++;

Implement loops a -f in Problem 3.1 and show heuristically that runtime grows according to Big-O for each set of loops