Question

1. (30 pts) Consider the following functions fb(n)31+1 +5n4 fa(n) 216 f(n) ((9n2) (6n) (121))1/2 fi(n)n-1 For these functions, do the following: (a) Prove the asymptotic complexity of each of the functions, in sim- plest terms. That is, for each function f, find the "simplest" function g such that f(n) e(g(n)) (b) Order the functions by asymptotic dominance. In other words, give a sequence fi, f2,... such that fi(n)O(fi(n Make a note if any two functions are asymptotically equivalent, i.e. if fi(n) = Θ(fin(n))

Since this is my last chance to post question, I have to post all of them. I will be very appreciate if you can answer all the parts!!   Thumbs up guaranteed

Answer 1

Given freton oxa tO O for acu function Simplet tuHon ncoasymptotłc cbmince ve a seguance.

too funeRoy ore o mp toticalla equivalent we Calcalale lo s S1gn olgn) 2. It's trul ' ul

it u 's

2. 니 eei

sts tsuo nlog n ts trui tis tuu 06 eIn1

*.4 is truo Sn itue