Problem
1.A fully bracketed expression is one of the following forms:
i. a simple operand;
ii. (op E) where op is a unary operator and E is a fully bracketed expression;
iii. (E op F ) where op is a binary operator and E and F are fully bracketed expressions. Hence, in a fully bracketed expression, the results of every operation are enclosed in parentheses. Examples of fully bracketed expressions are ((a+b)-c), (-a), (a+b), (a+(b+c)). Write methods that will translate expressions from (a) prefix and (b) postfix form into fully bracketed form.
2. Rewrite the method infix_to_postfix as a recursive function that uses no stack or other array.