Using stacks in C++, convert an infix operation to its prefix operation. Sample output will be provided (the postfix part is already done, I only need the prefix).

Use the C++ Standard Template Library's stack class to write a program for processing a file of postfix expressions. Recall that in a postfix expression, a binary operator comes after its two operands. Thus the infix expression (w + x) * (y – z) becomes w x + y z * in postfix. A postfix expression can be efficiently evaluated using a stack as follows. 1. Read the expression from the left to the right. 2. When an operand is encountered, push it on the stack. 3. When an operator is encountered, pop the top two elements from the stack, perform the operation, and then push the result. 4. There should be exactly one element on the stack at the end and this element is the value of the expression. For example, if the expression 20 5 – 3 * is entered, the evaluation should proceed as follows. Symbol read 20 Actions taken Push 20 5 Push 5 Pop 5, Pop 20, Push 20 – 5 Push 3 Pop 3, Pop 15, Push 15 * 3 The result of 45 should then be output. Your program should ask the user for the name of an input…

L

Can you describe the difference between the limited and unbounded stack versions?