1. For each function f(n) below, give an asymptotic upper bound using big-Oh notation. You should give the tightest bound possible (show your calculation).

1. f(n) = 100n³ 7n ³ + 14n ²
2. f(n) = log(7n ² )
3. f(n) = .001n + 100 2 n
4. f(n) = n ³ (1 + 6n + 2014n ² )
5. f(n) = (log n)(n + n ² )