1.Using the algorithm convertToPostfix, given in Segment 5.16, convert each of the following infix expressions to postfix expressions:

a. a * b / (c - d)

b (a - b * c) / (d * e * f + g)

c. a / b * (c + (d - e))

d. (a ^ b * c - d) ^ e + f ^ g ^ h

2. Show the contents of the stack as you trace the algorithm checkBalance, given in Segment 5.8, for each of the following expressions:

a. a {b [c * (d + e)] - f }

b. {a (b * c) / [d + e] / f )- g}

c. a {b [c - d] e]) f