Create a java program that simulates the conversion from infix to post fix. 1. The program will ask the user whether they want to do a conversion or exit the program. 2. If the user wants to do a conversion, proceed to step 3. If the user wants to exit, proceed to step 7. 3. The program accepts an expression from the user. 4. The program will display the process of conversion symbol, by symbol (table type-see example below). 5. The program will display the expression inputted by the user and the converted postfix. 6. The program will return to step 1. 7. The program confirms whether the user wants to exit. 8. If the user confirms, proceed to step 9. If the user denies, proceed to step 1. 9. The program exits. **Please use of the main method only.

\begin{tabular}{|c|c|l|} \hline Symbol scanned & Stack & \multicolumn{1}{|c|}{ Postfix } \\ \hline A & Empty & A \\ \hline & & A \\ \hline B & & AB \\ \hline & & AB \\ \hline C & & ABC \\ \hline/ & / & ABC \\ \hline 1 & /( & ABC \\ \hline D & /( & ABCD \\ \hline & /( & ABCD \\ \hline E & /( & ABCDE \\ \hline & / & ABCDE \\ \hline F & /( & ABCDE \\ \hline \hline & / & ABCDEF \\ \hline & Empty & ABCDEFF/ \\ \hline \end{tabular}