3. Determine the running time of the following algorithms. Write summations to represent loops and simplify. Show all work. If bounding is used, the upper and lower bounds must only differ by a constant. Note: This is not the line-by-line analysis method. This method will be covered on Tuesday after Quiz 3. Loops are inclusive. a) Func1(n) S for i 1 2 3 4 5 6 7 8 9 0; for j end 2 to 6n² do - 3 to n do for k end end return (s); 1 to n do ss+i-j + k;