Consider a stack implemented using an array with maximum size 5. Initially, the stack is empty. a) Perform the following operations and show the stack after each step: Push(10), Push(20), Push(30), Pop(), Push(40), Pop(), Push(50) [3 Marks] b) Explain how to handle stack overflow and underflow. Give examples for each case. [2 Marks]

Show how to implement a first-in, first-out queue with a priority queue. Show how to implement a stack with a priority queue.

Describe how a priority queue can be used to implement: • A FIFO queue. • A stack