Please show work using summations

Answer Questions a-d

Page CSE 2321 Foundations I Spring, 2019 Dr. Estill Homework 5 Due: Monday, February 25 1.) (80 points) Give the approximate running times of each of the following algorithms (a.k.a. write down what the algorithm returns for an input of n) and then state (don't prove) where in the hierarchy the running time exists. a) FUNCTION f(n) b) FUNCTION f(n FOR i 1 TO 5n DO BEGIN WHILE i6 DO BEGIN BEGIN 3 END END it-4i END RETURN(r) END RETURN()