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 e) FUNCTION fs (n) C40 WHILE i