Answer Happy

Calculate worst case time complexity for each of the following. Derive each step by assuming suitable value for n. i) for(i=1;i<n;i++) ii) for(i=1; i<n; 3*i); for(j=1; j<n; 4*j); for(k=1; k<n; k*c);