Give the asymptotic complexity of each of the following functions in simplest terms, and then order the functions by asymptotic dominance. That is, produce an ordering f1n(),f2n(),...such that fiOfi+1()i. Wherever two consecutive functions in your ordering are asymptotically equivalent, indicate this by using the notation fifi+1().

(a) fa(n) = log2 (6n + 7) x log (5n0.3 +21); (b) fo(n) = -(); (c) fe(n) = 2 log (4n + 17); (d) fa(n) = (4j+1); (e) fe(n) = 613, (f) fs(n) = 5n0.6 + 3n0.7, (g) f(n) = 6 log (n" + 3n%) + 3n0.2; (h) fn(n) = 3n2 + 2n + 74; (i) fi(n) = 5 log2 (3n +n+8); 6) S;(n = 2log (n) +3+7n; (k) f(n) = 2n logz (2n3 +17n+1); (1) fi(n) = 2 log: (n) + 2n + 3n