Imagine a stack S with the following three operations: Push (S, x): pushes the element x on the top of S; Pop (S): and returns the top element of S; Multipop(S, k): pops the top k elements of S (or until empty) and returns the last element; What is the time complexity of a sequence of interleaving n Push, Pop, and Multipop operations, assuming that s is empty at the beginning