1.Algorithm Analysis //Can you explain your steps too

Summary: Count the number of comparisons in the following code snippets. Then generalize it and represent your count by using N, where N=16. The following three formula may help you for analysis.

a)

int sum = 16; //N=16

while (sum >= 1){

sum--;

cout

}

b)

int sum = 1; //N=16

while (sum

sum=sum*2;

cout

}

c)

int sum = 0; //N=16

for (int i = 0; i

for(int j = 0; j

sum++; }}

d)

int sum = 0; //N=16

for (int i = 0; i

for(int j = i; j

sum++; }}

e)

int sum = 0; //N=16

for (int i = 1; i

for (int j = 0; j

sum++; }}

f)

int sum = 0; //N=16

for (int i = 1 i

for (int j = 0; j

sum++;

g)

int sum = 0; //N=16

for (int i = 1 i

for (int j = 0; j

sum++;

Please show work and thank you in advance

harmonic sum Hy = 1 + 1/2 + 1/3 + 1/4 + ... + 1/N In N triangular sum 1 + 2 + 3 + 4 + +N N2/2 geometric sum 1 + 2 + 4 + 8 +...+N = 2N-1 2N when N=2