Answer:
Push,Pop,Peek,IsEmpty,Display
Explanation:
Stack is LIFO (Last In First Out) data structure. Here the element which is inserted last will be retrieved first. It is mainly useful to store function calls in programming languages and also value types.
Push operation is used to insert or push an element into the stack
Pop operation is used to remove an element from the stack
Peek operation returns the topmost element of the stack. Top is a pointer which points to the element which we can retrieve from stack. If it reaches the maximum size of the stack then stack is full
IsEmpty is an operation which we can do to make a check on Stack to know whether it is Empty or not
Display operation is used to display all the element's which exist in the stack
