Suppose that you have a stack myStack and an empty auxiliary stack bStack. Show how you can do each of the following tasks by using only the ADT stack operations define in the stack ADT below:

stack ADT (Last-In-First-Out data structure)

Data: A sequence of data items that can be accessed at only one end,

called the top of the stack.

Operations:

Construct a stack (usually empty);

Check if the stack is empty;

Push(item): Add an element at the top of the stack;

Top: Retrieve and print the value of the item stored at the top of the stack;

Pop: Remove the top element of the stack;

a.Write code (pseudocode or C++) using the ADT operations to display the contents of myStack in reverse order; this is, display the top last. (hint: use bStack to help solve)

b.Write code (pseudocode or C++) using the ADT operations to count the number of items in myStack, leaving myStack unchanged. ) (hint: use bStack to help solve)

c.Write code (pseudocode or C++) using the ADT operations to delete every occurrence of a specified item from myStack, leaving the order of the remaining items unchanged. ) (hint: use bStack to help solve)