2. For each of the following three program fragments, give an analysis of the running time. First, give the total number of times of each statement being executed. Then give the summed/total time in BigO notation using function with the least order of magnitude. Basically don't say the complexity is O(N9) if it is also O(N2). (21 pts) (a) Sum=0 for (i=1;iN;i++) Sum = Sum +i; (b) Sum =0; for(i=1;iN3;i++)for(j=1;jN2;j++)for(k=1;kN;k++)Sum=Sum+1 (c) Sum =0; for(i =1;iN;i++) for (j=1;ji;j++) Sum = Sum +1 (d) x=100; y=0; for(i =1;iN;i=2i) x=x+i; for (j=1;jN;j++) if(x>y/j) y=y+i/j; else y=y1