2. [10] Given the following expression in infix notation: ife = "9 - 2 + 3 + 5* (7 - 4 )" a) [4] determine the postfix token list (pfe), using Dijkstra's shunting yard algorithm: pfe: b) [4] complete the following table to show the stack contents during the evaluation of the following postfix expression (note: not the same as above), and the final resulting value: pfe = "9 2 3 + - 57 + + 4 -" Token: 9 E Stack: 9 c) [2] Final value after pfe evaluation