Question

Can anyone help out this question....?
Arrange the following functions in increasing order of growth rate. ie. if g(n) follows f(n) in your list, then f(n) is necessarily O(g(n)).

a)2^2n
b)2^n^2
c)n^2log(n)
d)n
e)n^2n