Making a Stack in Python

Now that we understand the behaviour of a stack a little better, we can try to implement it$.$

A stack can be implemented using a list, where the first element in the list is at the bottom of the stack and the last element is at the top of the stack. For the following questions, we shall assume that stacks are implemented in the manner just mentioned.

Your task is now to create a class Stack with a constructor for a stack that takes in a sequence seq and returns a stack representation of the sequence where the last element in the sequence is at the top of stack and the first element is the bottom of the stack.

In addition, define the following methods:

push$($val$)$: push the value into the stack

pop$()$: pop the value from the stack and return the value

is$\_$empty$()$: returns True if the stack is empty and False otherwise

peek$()$: returns the top of the stack without removing itTo add items to the stack, we push them onto the stack, and to get the top element from the stack, we pop it off the stack.