1. Rank the following functions in increasing order of asymptotic complexity. So if your order has two functions f and g occurring consecutively, you will be asserting that f E O(9). However, if in your order there are two successive functions that are of each other, indicate this in your solution as well. (a) n (b) n1.5 (c) 3 (d) Vn (e) n log n (f) n log logn (g) n log n (h) Inn (i) log ny () (log n) 5 (k) 15000 (1) 2n (m) 22n (n31 (0) log(n!) (p) log(2") (9) 2n+1