Use of Stacks In this assignment you will a stack to convert prefix expressions directly to postfix expressions. You may not use recursion as we will use recursion to revisit this problem in Lab 2. Write a program that accepts a prefix expression containing single letter operands and the operators +, -, *, /, and $ (representing exponentiation). Output the corresponding postfix epression. Use java programming please.

Input file should be implemented and an output file with answer created.

input file contains:

-+ABC -A+BC $+-ABC+D-EF -*A$B+C-DE*EF **A+BC+C-BA /A+BC +C*BA *-*-ABC+BA /+/A-BC-BA *$A+BC+C-BA //A+B0-C+BA *$A^BC+C-BA