Exercise 2.8. Suppose we are given n numbers a1,a2,,an that we want sort (from smallest to largest number). Consider the algorithm linear in Algorithm 3, that will sort the n numbers. a. What is the (worst-case) running time of this algorithm? You may provide the answer as O(f(n)), for some function f(n). b. For each n construct a sorting problem, i.e., the initial ordered set of numbers, such that the algorithm performs (f(n)) operations, for the function f(n) that you obtained in part (a)