we come across several such structures in our day-to-day life consider pile of plates as shown below notes po push stack of plates clearlyan element can be inserted in stack only on the top and can be retrieved only from the top the following are the operations on stack spush(sethis inserts an element into the stack pop(sae this deletes an element from the stack and stores it in isempty(sae true/false this checks if the stack is empty isfull(sae true/false this checks if the stack is full or not point to remember is that the above three operations are the only ones permitted with which stack could be operated on consider the following stack of integers to understand the stack operations to - to to empty to to to after push after push after pop after push stack full stack operations in pseudo-codestack-empty(sif top[ return true else return false push(sxtop[ <top[ [top[ ]< pop(slovely professional university