Partition the following functions representing running times into equivalence classes so that f(n) and g(n) are in the same class if and only if f(n) = (g(n)). Logarithms are base two unless stated otherwise.

Partition the following functions representing running times into equivalence classes so that f(n) and g(n) are in the same class if and only if f(n) (g(n). Logarithms are base two unless stated otherwise 4n + 16n/s (7n/8)! 3/2 4(n!) 1.3n (log(3n)3 5/2 2 log n n2 log(3n) log(2n2) (log n)1/4 2 log log(2n) log(log(2n))4logn 0.99 After determining the equivalence classes, rank (and list) the classes from smallest to largest (in terms of growth rate with respect to n). Clearly indicate functions in the same equivalence class. Show your complete work when comparing the following three function pairs 4n +16n/5 vs. 4ogn n2 log(3n) vs. (log n)/4 1.3n 0.99" vs. 2