The increasing order of following functions in terms of asymptotic complexity is:
(A) f1(n) < f4(n) < f2(n) < f3(n)
(B) f1(n) < f2(n) < f3(n) < f4(n)
(C) f2(n) < f1(n) < f4(n) < f3(n)
(D) f1(n) < f2(n) < f4(n) < f3(n)
I saw this question on GeeksQuiz but I am unable to understand its answer. The correct answer is D.
I think that f(2) will have the highest complexity among all because for a given number it will give the maximum output.
Please help and explain how is it solved?