Rank the following functions in order from smallest asymptotic running time to largest. For the ordering requirement, write the function identifier letters in order. Your submission for this question should be exactly as many characters as there are functions. For example, if you believe the functions are currently listed in asymptotic order, your answer should be "abcdefg" (without the quotes). Capital or lower-case does not matter to the form. The term log2 n refers to (log n) 2 and not log(n 2) Remember that all logarithms are base-2.
(a) 1.01^n
(b) 10^4 x underroot n
(c) 10^100
(d) log^2n
(e) 1.44n^2
(f) 8675309 log n
(g) 561n log n + 1729n