2. (8 points). Consider the following grammar of expressions: (exp) := (id) I (no) | (exp)+(exp) | (exp)* (exp) (id) := XYZ (no) denotes unsigned integers as in the class notes/discussions. Rewrite this grammar such that the operations will be evaluated strictly left to right; i.e., X + Y * Z will be evaluated as if it was (X+Y) * Z; and X * Y+Z will be evaluated as if it was (X+Y) +Z. But do NOT introduce parentheses or other new terminal symbols into the language. Use only pure BNF, i.e., the version of BNF that we have been using in class, for solving these problems