please note that for part a and part b you need to evaluate the following series and write down the big-O in terms of n. For part c, the way you answer is similar to above, but the question is in code form(but please don't answer in code form, just answer same way as above), and the part a and part b in the part c is not same as above, don't mix up.

If you don't know what do I mean, sorry for unclear, just ignore me, but please don't mix up the //part a, //part b in part c as it is not same as the a. , b. above.

Evaluate the following series and write down the big-O in terms of n. a. f(n)=i=0n1i2 b. f(n)=i=0nj=in(3i+2j) Analyze the for-loop statement and express the number of operations in terms of n, and thus, write down the big- O in terms of n. In this problem, declaration of variable, assignment operator, arithmetic operator and logical operator count 1 operation. // part a,n is defined before this line int j, sum =0; int i; for (i=1;ij;k){ sum++; \} 3 \}