Which of the following options provides the increasing order of asymptotic complexity of functions(Note: Consider log base 2)
a) f1(n)=n logn log logn
b) f2(n)=(n!)^1/n
c) f3(n)=(n^n^(0.5))
d) f4(n)=log n^n
At first glance I thought f2 grow faster but i was wrong.
Ans : f2,f4,f1,f3
Please can somebody help.