Consider the infix expression 16 - 42 23 Provide the contents of the stack after processing each input token during the infix-to-postfix conversion algorithm. Similarly to the practice exercises, arrange your stacks from left (bottom) to right (top) using exactly one space between items. For example, if the stack contains a on the bottom, b in the middle, and c on top, you would submit a bc Also show the current state of the output string at each step using the same format of space between items. If any answer should be left blank, enter empty input token stack output string 16 2 Final postfix expression