implement a Stack using an array or a list. You will implement the following basic operations for

the stack and answer the corresponding questions. Write clear and concise code, and submit

both the implementation and your written responses.

Part $1$: Stack Implementation $(60$ points$)$

You need to implement a stack class with the following operations:

$1.$ Push $(20$ points$)$

Implement the $`$push$()`$ method to add an element to the top of the stack.

$2.$ Pop $(20$ points$)$

Implement the $`$pop$()`$ method to remove and return the top element of the stack. Ensure that

the method handles an empty stack gracefully by returning an appropriate message.

$3.$ Peek $(10$ points$)$

Implement the $`$peek$()`$ method to return the top element of the stack without removing it$.$ If the

stack is empty, return an appropriate message.

$4.$ isEmpty $(10$ points$)$

Implement the $`$isEmpty$()`$ method to check whether the stack is empty.

$---$

Part $2$: Short Answer Questions $(40$ points$)$

Answer the following questions:

$1.$ What is the time complexity of the push and pop operations in a stack?

$(10$ points$)$

$2.$ What are some real$-$world applications where you would use a stack data structure? List at

least two examples.

$(10$ points$)$

$3.$ Explain the difference between a stack and a queue.

$(10$ points$)$

$4.$ What happens if you try to pop an element from an empty stack in your implementation?

How can you handle this gracefully in your code?

$(10$ points$)$

$---$

Bonus $($Optional$,10$ points$)$:

Implement a method to print the contents of the stack from the top element to the bottom.

$---$

Submission Instructions:

$1.$ Submit your code implementation in a programming language of your choice..

$2.$ Write your answers to Part $2$ in a separate document $(.$txt or $.$docx$).$

$3.$ Ensure your code is well$-$commented and formatted.

$---$

This assignment will help students grasp the foundational operations of stacks, an essential

data structure used in various applications