n this assignment, you will be implementing your own Array$-$Based Stack $($ABS$)$ and Array$-$Based Queue

$($ABQ$).$ A stack is a linear data structure which follows the Last$-$In$,$ First$-$Out $($LIFO$)$ property. LIFO means

that the data most recently added is the first data to be removed. $($Imagine a stack of books, or a stack of

papers on a desk$$the first one to be removed is the last one placed on top.$)$

A queue is another linear data structure that follows the First$-$In$,$ First$-$Out $($FIFO$)$ property. FIFO means

that the data added first is the first to be removed $($like a line in a grocery store$$the first person in line

is the first to checkout$).$

Both of these are data structures$$some sort of class to store information. What makes them different is

how they store and access the information. Adding the same values $($say$,$ the numbers $1-10)$ to either

data structure would result in different ordering$/$output of the information. Why you might choose one

or the other depends on the specific needs of a program