1. SuperStack (based on a problem by Prof. Michael Dillencourt) Consider a superstack data structure which supports four operations: Create, Push, Pop, and MultiPop. The new MultiPop operation is given a non- negative integer k and array A, pops the top k elements, and stores them in A. MultiPop throws an exception if k is greater than the number of elements on the stack, or the size of A. All four operations are implemented using an underlying standard stack as shown below. SS_Create(): S = Stack.Create() SS_Push(x): S.Push(x) SS_Pop(): return S.pop() SS_MultiPopCk, A): if (k > S.Size()) or (k > A.Size()): throw exception for (i = 0; i