Give the asymptotic complexity of each of the following functions in simplest terms and then order the functions by asymptotic dominance. That is, produce a permutation, fi(n) f2(n), .. such that fin)O(fi+(n). Note if any two functions are asymptotically equivalent, i.e., if f (n)- (fi+1(n)). Note: Ig x' is a simpler notation for log2 x. 1. (n) 3n4n .fe(n) 6n02 + 3n08 a(n)2 nn51011g (n+100) b(n) ((9n2( 6n)(1212 (n)nlgn n2lg n3 5000n faln) 310