please please help me i know there is similar question like this on chegg but the code fragment are different)Find n) and o(f(n)) for code fragment 4 given in Figure 1. Your analysis should be patterned after the analysis in Figure 6 that used code frag O. Transform the code fragment 4 into while-loops. Account for the cost of each line. Sum the total and express it in closed form. Int sume for (int o=0;ompo++) sum=sum2; while (sum) Figure 1. Code Fragment Intsumo for (int i;;) ; Figure 2. Example Code fragment example of fragment o for the answer to be modeled from Line Code 1 1 sum=0; 2 3 while Cost 1 1 -1 ; Sia 1 4 sumo; > 1 - 5 > 1 6 > Total 1 Tmn +3 Figure 6. Analysis of Code Fragmento example of finding of(n)) using code frag O: 1. Find (n). Let | () be the tastest growing term in T(n) with its coefficient removed. f(n) = 2. Find C. 2.1. C = Cmia + A, where A= 1 (in many cases). 2.2. min = lim lim = - (n) 3 Discrete Structures Code Fragment 4 Time Complexity CMSC 2123 Project po4 2.3. In practice, min is the coefficient of the fastest growing term in Tn). 3. C-A3-1+3 - 4 4 Find a 4.1. Solve T (NOI S CIS (no ) 3no + 3 ) sum- Figure 1. Code Fragment 3 int sum=0; for (int i=0;i