Implement a stack using an array 

Implementing a stack using an array is a straightforward process. A stack is a Last In, First Out (LIFO) data structure where elements are added and removed from the top of the stack. Here’s how you can implement a stack using an array in various programming languages:

Key Operations

1. Push: Add an element to the top of the stack.
2. Pop: Remove and return the element from the top of the stack.
3. Peek (or Top): Return the element at the top of the stack without removing it.
4. IsEmpty: Check if the stack is empty.
5. IsFull: Check if the stack is full (if you have a fixed-size array).