TIME SENSATIVE DATA STRUCTURES OF JAVA.!!!

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 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 8. Using the algorithm evaluatePostfix, given in Segment 5.18, evaluate each of the following postfix expressions. Assume that a = 2, b = 3, c = 4, d = 5, and e = 6. a. a b + c * d - b. a b * c a -/d e *+ c. a c - b^d +