(a) [4 pts] Consider the following AST in the linear S-expression form: (* (+ a b) (- (* c d) e)) Give two syntactically different Python arithmetic expressions that correspond to this AST. (Hint: Syntactically different means the expressions have distinct parse trees.) (b) [6 pts] Consider the following expression from some language X: a + b +c* d + e*f*g i. Assume the common arithmetic properties, i.e. * has precedence over + and left associativity among operations of the same precedence level. Show an AST in the linear S-expression form. ii. Now, assume that the arithmetic properties are flipped, i.e. + has precedence over * and right associativity among operations of the same precedence level. Show an AST in the linear S-expression form. (a) [4 pts] Consider the following AST in the linear S-expression form: (* (+ a b) (- (* c d) e)) Give two syntactically different Python arithmetic expressions that correspond to this AST. (Hint: Syntactically different means the expressions have distinct parse trees.) (b) [6 pts] Consider the following expression from some language X: a + b +c* d + e*f*g i. Assume the common arithmetic properties, i.e. * has precedence over + and left associativity among operations of the same precedence level. Show an AST in the linear S-expression form. ii. Now, assume that the arithmetic properties are flipped, i.e. + has precedence over * and right associativity among operations of the same precedence level. Show an AST in the linear S-expression form