LISP SYNTAX

Must show work, be detailed about how the work is done. Thank you

1. In a certain language expressions are written in infix syntax. The language has binary, prefix, and postfix operators that belong to the following precedence classes [none] [none] binary ops preiix ops posttix ops associativity 1st Class: 2nd Class: 3rd Class: right left right [none] lst class operators have highest precedence and 3rd class operators have lowest precedence (a) Say which operator is applied last in the following expression, and then draw the abstract syntax tree of the expression. [To help you, subscripts have been attached to each operator to indicate its precedence class and whether that class is left- or right-associative, even though this information can also be obtained from the above table.l (@3R a #IR u) @2L w $2L %3R (5 ^3R ~IR C) ^3R d (b) Rewrite the expression in prefix syntax. (c) Rewrite the expression in postfix syntax