Q1: For each function f(n) below, give an asymptotic upper bound using \big-Oh" notation. You should give the tightest bound possible (so giving O(2") for every question is unlikely to result in many points). You must choose your answer from the following list. The list is not in any particular order. O(n), O(n2,(2"),O(n12),O(n1/4), O(n3).O(n4), O(n5), O(n6),(n),O(n), O(n) 0(log3n). 0(n2 logn). 0(log8m),O(log4n),O(n log3n).0(log2 n),O(log n),(1),O(n3 log n), O(n),O(n log log n), O(n log2 n), O(log log n),O(n logn) (a)f(n) 100n3-7n314n2 (b) f(n)= 100n3-100 +7n2 (c) f(n)= log(7n2) (d) f(n) 5log log n+ 4log2(n) (e) f(n)-.001n +100-2" (f) f(n) = n3(1 + 6n + 2014n*) (g) f(n) (log n (nn2)