f. Which case of the master theorem is used for e? 4. (5pts) Find the asymptotic running time of each function in pseudo code. Use the big notation. The parameters A are all lists (arrays) of integers with indices 1 to n. Allowed keystrokes: ,Theta", power w. log . log, a. funetion fl(Al1 to n]) sum-o for i-l to n sumAl51 b. funetion 2(Al1 to n] um-0 while n-1 sum +-A[n] n/5 c. funetion E3(A1 to n]) ni - In/2 if nel return Al1 else return f3(AII to nl)f3(AInl+1 to n]) d. function 4(AI1 to n]) if ne-l return At1 return f4(Al1 to n-1]) f4 (AI2 to n]) else (Hint: Write its running time recurrence. Solve it by repeated substitution.) e. funetion fS(Al1 to a]) sun, nl 0,In/3) tor i-l ton sum 1-3 return sunm+ S(Al1 to ni)+ ES(Atn-ni to n])