1. [6 pts.] Order the following functions f(n) by asymptotic growth rate, from slowest asymp- totic growth rate (#1) to fastest (#6). | 3n3 + 7n2 | 2n+5 | 22 logn | 6n + 50 log n 215 2n log n + 3n f(n) Order # 2. (10 pts.] Show that the function T(n) = 3n+ 5n log(n) + n +5n2 log(n) is O(n). Justify your answer by providing real constant(s), corresponding to the lower- and upper-bound constant factors c and d', respectively, and the integer constant no > 1, consistent with the definition of big-Theta