Question e

Please show work using summations and inequalities please

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 (n) b) FUNCTION f(m) FOR i 1 TO 5n Do BEGIN WHILE i 3n2 DO BEGIN WHILE j DO FOR j 1 TO i DO BEGIN END RETURN() END END Jan 9, 2019 Jan 9, 2019