1. Transform each of the following expressions to infix expressions. a. ++A-* $ BCD/+EF* GHI b. +-SABC*D**EFG C. AB-C+DEF-+$ d. ABCDE-+$*EF*. 2. Apply the evaluation algorithm in the text to evaluate the following postfix expressions, where A=1, B=2, and C=3. a. AB+C-BA+C$- b. ABC+* CBA-+* 3. Write a prefix method to accept an infix string and create the prefix form of that string, assuming that the string is read from right to left and that the prefix string is created from right to left. Handle variables, +,-./,+,$, (,)