What is the time complexity for this?

sum=0; for(i=0;i

Answer as shown below:

Example 2 Find the time complexity of function findmax in Figure 2 that finds the maximum value in the array of integer given by the two parameters A and n int findmax(int All, int n) f int max-A[0]; for (int i-1;ikn;i++) if (A [i]>max) max=A[i]; return max, Figure 2. Program for Example 2. Solution: Complete the following steps 1. Create a three column table putting line numbers in the first column, statements of the program in the second column, and the cost of each statement in the third column. Sum the cost of the individual statements to find the cost of the program. 2. Line Statement Cost 1 int findmax(int All, int n) { int max=A[O]; int i1; while (imax) max-AM; 2k return max, Total Total Total T(n) 4k + 3 T(n)-4(n - 1) +3 T(n) = 4n-1