Problem 1: Let n be a positive integer. Partition the following set o functions into equivalence classes such that f(n) and g(n) are in the same equivalence class if and only if f(n)= e(g(n)). (If a base of a logarithm is not specified, it is assumed to be equal 2.) glogan 1+ log, 125 n" 1 loga (nn) log (n. 8") + 2" 2n n log n log, 25 n log n+n" 8 + -13 n log (n!) logn en n n log Vn logs (4n) 21 2n log, 4 Then arrange the equivalence classes into a sequence C1,C2,C3... such that for any f(n) E C; and g(n) Ci+1 f(n) = (g(n))