Rank the following functions by their order of growth (i.e. asymptotic efficiency class), from

slowest-growing to fastest-growing. (a) n2 (b) log n (c) 4log n (d) n log n (e) log log n (f) n (g) 2n (h) n! (i) 2n+1 (j) n1.001 (k) ( 3 2 )n (l) n log log n (m) 2n/2