(a) Rank the following 15 functions representing running times in terms of growth rate with respect to n). Group functions together if they are in the same equivalence class (i.e. f(n) and g(n) are in the same equivalence class if f(n) = (g(n))). Logarithms are base 2 unless stated otherwise. Show the final ordering with equivalence classes, from smallest to largest. No need to explain your answers. nlong v n! (log n) va 4logn (2n)1.99 log n n/logn 3" log;(n log n) logn log(log(2n)) 10n/2-3 log(2n) (n-2)! 7,2021 (b) Show your complete work when comparing the following function pairs. Provide the C and k values in the formal definition when asserting a big 0, 2, or relationship (e.g. f(n) is (g(n)) if there exists C > 0 and k >0 such that f(n)