Provide the postfix expression corresponding to the following infix expression (separate each token by a single space in your answer; there should not be any trailing spaces): 2 - 3 * ( 5 - 9 / ( 1 + 2 * 4 ) ) + 8

QUESTION 4 Choose what happens with operands and operators when (a) converting infix expressions to postfix, and (b) evaluating postfix expressions: O 1. (a) no operands go on stack, (b) no operators go on stack O 2. (a) all operands must go on stack, (b) no operators go on stack 3. (a) all operands must go on stack, (b) all operators must go on stack 4 (a) no operands go on stack, (b) all operators must go on stack QUESTION 5 Any recursive solution can also be efficiently implemented with neither stacks nor queues 2. stacks but not queues 3. both stacks and queues 3 queues but not stacks QUESTION 6 Provide the postfix expression corresponding to the following infix expression (separate each token by a single space in your answer; there should not be any trailing spaces): 2-3*(5-91(1+2*4))+8 TTT Arial