Can you please just solve the 12th question?
Extracted text: 9. Assume the following rules of associativity and precedence for expressions: Precedence Highest *, /, not +, -, &, mod - (unary) =,/=, <,><=,>=, > and Lowest or, xor Associativity Left to right Show the order of evaluation of the following expressions by parenthe- sizing all subexpressions and placing a superscript on the right parenthe- sis to indicate order. For example, for the expression a + b * c + d the order of evaluation would be represented as ((а + (b * c)')² + d) 3 а. а * b 1 + C b. a (b - 1) / с mod d с. (а b) / с & (d e / а - 3) d. -a or с d and e е. а > b хоr с or d <- 17 f. -а + b 10. show the order of evaluation of the expressions of problem 9, assuming that there are no precedence rules and all operators associate right to left. 11. write a bnf description of the precedence and associativity rules defined for the expressions in problem 9. assume the only operands are the names a,b,c,d, and e. 12. using the grammar of problem 11, draw parse trees for the expressions of problem 9. 17="" f.="" -а="" +="" b="" 10.="" show="" the="" order="" of="" evaluation="" of="" the="" expressions="" of="" problem="" 9,="" assuming="" that="" there="" are="" no="" precedence="" rules="" and="" all="" operators="" associate="" right="" to="" left.="" 11.="" write="" a="" bnf="" description="" of="" the="" precedence="" and="" associativity="" rules="" defined="" for="" the="" expressions="" in="" problem="" 9.="" assume="" the="" only="" operands="" are="" the="" names="" a,b,c,d,="" and="" e.="" 12.="" using="" the="" grammar="" of="" problem="" 11,="" draw="" parse="" trees="" for="" the="" expressions="" of="" problem="">