Convert the following expressions to both Prefix and Postfix / Infix and create the binary trees that represent them.

            

 

A.        P * (Q + R) + S / T * W - X * Y + Z 

 

 

            B.        (A + B) * (C + D * E) / F / G / H+I 

 

            

            C.         J K L $ * M N - P * + Q R * - S +