Implement the stack used in assignment 2 in Java. Here is a driver for your stack class. This driver implements parenthesis matching.

• This should give identical results as assignment two.

• You CANNOT assume anything about the number of items that can be stacked. Since java does NOT have pointers you have to use java arrays which are dynamically allocated. Talk to me about how to implement an arbitrary length stack using java arrays.

• You may use the same test cases as for assignment two but you will need extra cases to completely test your program.

Use the normal turning procedure.