2. (15 points) Arrange the following functions in order of non-decreasing growth rate; i.e., fi may precede only if fi = 0(f; ). There is no need to show proof of the ordering. f1(n) = n2 fg(n) = V100 Ig (n) = n + 10 f4(n) = 2n fs(n) = 10" fe(n) 2n log n (n) = log log n fs(n) = 2logn o(n)2100