Problem 2 (5 points) Rank the following functions by order of growth (You need not prove the correctness of your ranking). That is, find an order fi, f2, f3, ..., fg so that fi = O(f2), f2 = O(63), and so on: (a) log n (b) 21 (c) n log n (d) n (e) Vn log n (f) n? (g) n! (h) 2logn (i) n