Partition the functions above into equivalence classes so that f(n) and g(n) are in the same class if and only if f(n) = (g(n)). 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. Use the name of the functions (i.e, the fis) instead of their explicit forms. There is no need to explain your solution.

fi : (n -1)! f2 : 2n3 +n(log n)6 fs: 7log logn fs : 3n lo g3 n fs n! fo : (log n)2018 fio : 2n2* f2 : log log(nvn) 0.18 13 log n fi4 : log(n!) (Logarithms are base 2 unless stated otherwise.)