Topic: Data Structure and Algorithm. Design and implement a program to convert an infix expression to its corresponding postfix expression using a stack. The program should support expressions containing operators $\text{'}+\text{'},\text{'}-\text{'},\text{'}*\text{'},\text{'}/\text{'},$ and parentheses $\text{'}(\text{'}$ and $\text{'})\text{'}$ and provide a mechanism to handle operator precedence and parentheses.

Example Testcases

Input:

A$*$B$+$C

Output:

AB$*$C$+$

Input:

A$+$B$*$C$-$D$/$E

Output:

ABC$*+$DE$/-$

Input:

$($A$+$B$)*($C$-$D$)$

Output:

AB$+$CD$-*$