2. recall that we say that f(n) is o(g(n)) if and only if for some constants c > 0 and n0 ≥ 0, for all n > n0, f(n) ≤ cg(n). for each of the following pairs of functions, find values of c and n0 that demonstrate that f(n) is o(g(

(a) f(n) = 3n + 5, g(n) = n
(b) f(n) = n 2 + 10n + 21, g(n) = n 2
(c) f(n) = 2n + 12, g(n) = n
(d) f(n) = 2n + 12, g(n) = n 2
(e) f(n) = 3n 3 + 2n 2 + n + 1, g(n) = n 3