Problem 1:

Show the contents of the two stacks step by step as you manually trace the algorithm evaluateInfix, given in Segment 5.21, to evaluate the following infix expressions. Alternatively, you can use the steps in the algorithm given in Lab 10 (for the extra credit task).

Assume that: a = 2, b = 3, c = 4, d = 5, e = 6, and f = 7.

a) (a + b ) / (c d) 5

b) e b * c ^ a + d

Problem 2: Write a client program ReverseString that uses a stack to reverse an input string. Note: You have to include the file StackInterface.java and one of the stack implementing classes (either ArrayStack.java or LinkedStack.java) in your project. In your client class ReverseString you have to create a stack of type StackInterface for holding the letters (characters) of the string. Note: A solution not using a stack and the stack interface and an implementing class will not count.