Python question involving stack, queue, and/or deque

Question 2 Give a Python implementation for the MaxStack ADT. The MaxStack ADT supports the following operations: MaxStack ): initializes an empty MaxStack object maxS.is empty ): returns True if maxs does not contain any elements, or False otherwise. len (maxS): Returns the number of elements in maxs maxS.push (e):adds element e to the top of maxS. maxS.top ): returns a reference to the top element of maxS, without removing it; an exception is raised if maxS is empty. maxS.pop ): removes and return the top element from maxS; an exception is raised if maxS is empty. maxS.max ): returns the element in maxS with the largest value, without removing it; an exception is raised if maxS is empty