4. 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 fi(n), f2(n),... such that for all i, fi E O(fi+1). Wherever two consecutive functions in your ordering are asymptotically equivalent, indicate this by using the notation f E (f ). You do not need to justify your answers for this question. (a) fa (n) = logs(6n + 7) x log (5n0.3 + 21); (c)(n) = 2 log2(4n+17); d(n) = (e) fe (n) = 613. (f) fr(n) = 5n0.6 + 3n0.7. (h) fm(n) = V3n2 + 2n + 74; (i) f(n) = 5log2(3n2+n +8); (j) (n) = V2 log2 (n) + 3 + 7n; (k) fk(n) = 2n logs(2n3+17n+1); (I) f(n) = 2 log3(n) + 2n + 3n