Given the following BNF:

(1) Rewrite the above BNF to give + precedence over and force + to be right associative.

(2) Using the given BNF, draw a parse tree and a leftmost derivation for each of the following statements:

assign id = expr A | B | C )id A=A(B+C)A=B(C(A+B))