Problem 2 (40 points): (a) [25 points] Take the following functions and arrange them in ascending order of growth rates. That is, if function g(n) immediately follows function f(n) in your list, then it should be the case that f(n) = 0(g(n)). Justify your answer. J1 (n) = 2V logn 94(n) = n(log n)3 gs(n) nlogn 97(n) = 2n2 (b) [15 points] Assume that you have two functions f(n) and g(n) such that f(n) O(g(n)). For each of the following statements, decide whether you think it is true or false and accordingly give a proof (if true) or a counter-example (if false) (i) log, f(n) is O(log2 g(n)), under the assumptions of f(n) 2 1 for alln, and log2 g(n) 2 1 for all n. (i) 2/) is 0 (2/) (ii) f(n)2 is O (g(n)2), under the assumptions of f(n) 2 1 for all n, and log2 g(n) 2 1 for all n