Now that we have a baseline understanding of abstract data types, we will be exploring a very common data structure $-$ the stack. Stacks are essential in understanding how computers work; the call stack is the foundation of how computer programs run.

The stack ADT can also be leveraged to greatly simplify any program that requires a collection of items where operations only occur on one end. Before we go any further, we$$ll look at one possible way to implement a stack using a generic array.

Implement the stack ADT following the interface provided. Then, design and implement a driver class that tests all the stack operations. This test should check all edge$/$boundary cases, such as$,$ what happens when you pop from an empty stack? What happens when you push to a full stack? What happens if you try to use the toString method in a variety of situations?

Lastly, create a menu driven application that tests the push, pop, and peek methods using integers.