1.) (30 points) Either by showing exact inequalities or using precise limits, find the asymptotic complexity of each of the following functions in the simplest terms that you can and then order them by "asymptotic dominance", i.e. produce an ordering fi (n) fa(n) fa(n) where g(n) h(n) means that g(n) E 0(h(n)). So, for example, l log(n) n n2 (a) fa(n) ( (b) (n) = 2 los(4m + 17) 2n (d) fa(n) (e) fe(n) 613 5n0.6 + 3n0.7 (g) fe(n) = 2n 108s (2n3 + 17n + 1) ) (30 points) Do the same as in problem #1, but this time you don't have to be rigoroa (that is to say you don't have to prove the algorithmic complexity, you can just clair it)