Write a class for Stack. Stack is a special list that keeps a list of number and maintains the rule of last-n first-out. Think of them like a pop-up stack of plates at a restaurant; the first plate put in will be the last one pulled out and used. You will need to implement 3 functions._init_push, and pop. _init_0) function will initialize an empty list for storing the numbers. Push function will add one number to the top of the stack, pop function will pop out and return the top item of the stack. (Hint, use a list numberList to store the numbers that you push into the stack, use del numberList[0] to remove the top number, use insert() to push a number to the list). After you finish the implementation, use the following statements to test it. >>stack StackO) >> stack.push (5) >> stack.pop) >> stack.push (7) stack.push (6) > stack pop) stack.pop) >> stack.pop () The stack is empty