For each of the pairs of functions f and g given in the table below, determine if f(n) = O(g(n)), 2(g(n)), or O(g(n)). Justify your answers by providing constants c > 0 and/or c2 > 0, where f(n) c2-g(n) for all n> 1. f(n) g(n) n/100 + 1 2n nil n log n n+ n log n nvn n log (n) n (log n)? 22n 21+2