Create a new IntStack with an initial capacity of $5$ and use a loop to add all numbers between $0$

and $5($exclusive$)$ to it$.$ Then use the toString$()$ method to print it out.

Then remove and print each element in the queue until it is empty. Once the queue is empty, print

it out again.

Expected Output:

Queue $($size$=5)$: $0,1,2,3,4$

Removed: $4|$

Removed: $3$

Removed: $2$

Removed: $1$

Removed: $0$

Queue $($size$=0)$: $[]$Develop a Java program to compute the result from a postfix $($Reverse Polish notation$)$

mathematical expression $($discussed in the class$)$ using a STACK. Max size of the stack is $25.$

The program will read the postfix notations from a file called input.txt where each line represents

one postfix notation. Your program will be able to handle multiple lines $($for multiple postfix

notations$),$ and the file will end with a $\text{'}0\text{'}.$ The outputs will be shown on the screen. The characters

are single space$-$separated in each line.