Infix to PostFix Converter

Input - contains a collection of error-free infix arithmetic expressions, one expression per line. Expressions are terminated by semicolons, and the final expression is followed by a period. An arbitrary number of blanks and enf-of-lines may occur between any to symbols in an expression. A symbol may be an operand (a single upper-case letter), an operator (+,-,*,/), a left or right parenthesis Sample input: A+B-C; A+B*C; (A+B)/(C-D); (/*/(A+B)*(C-D)+E)/(F+G) OUTPUT - should consist of each input expression followed by its corresponding postfix expression. All output (including original infix expression) must be clearly formatted (or reformatted) and also clearly labeled. Sample Output: Infix: A+B-C; Postfix: AB+C- Infix: A+B*C; Postfix: ABC*+ Infix: (A+B)/(C-D); Postfix: AB+CD-/ Infix: ((A+B)*(C-D)+E)/(F+G) Postfix: AB+CD-*E+FG+/ Program may utilize any of the operations in the Stack ADT, must devise a Boolean function that takes two operators and tells you which has a higher precedence. Outside of the Stack ADT operations, your program may not assume knowledge of the stack implementation. If you need additional stack operations, you should specify and implement them using the operations for the Stack ADT ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. A listing of source program. A listing implemented test plan, inlcuding output. Must be able to compile on a Boorland C++Builder 4. ## Deadline information I need to have the program completed before 8Oct so I can make sure it runs and everything. Also if a separate program can be created based on the one above, just in reverse order that would be awesome! I could really use the extra credit.