Chapter 5 of the textbook describe an algorithm for evaluating directly an infix expression. 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 the Appendix below.

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