Suppose the following operations are performed on an empty stack:
push(0);
push(9);
push(12);
push(1);
Insert numbers in the following diagram to show what will be stored in the static stack after the operations above have executed.

Static stack is the stack having fixed size. It can’t be changed at runtime. Static stacks are always implemented with arrays.
• Stack follows LIFO approach. LIFO stands for Last-in, First-out.
• The element of the stack is inserted using PUSH operation and goes down to current TOP position of the stack.
• The TOP of an empty stack is at -1 position that means the stack is empty.
• Insert 0 onto the stack.
• Similarly, insert 9, 12, and 1 onto the stack.