The operation of a stack adds a new element to the top or it . pop B.top push D. insert rt II: Short Anwers Questions (70 points) 20 points) Find the Big-Oh complexity (tight upper bound) of the following expressions. Proof wers. og(n)) Expression a) f(n) = 0.01n2 + 100n b) f(n) = 2n log, n + n? 1) By definition of Big-O, we need to find some constant c and no such that f(n) Scg(n! 120. 2) By definition of Big-12, we need to find some constant c and no such that f(n) ch no your answers below