Problem 2. Consider the following grammar: assign> + I * (expr>) Using the above grammar, show a parse tree and a leftmost derivation for each of the following statements: Problem 2. Consider the following grammar: - id> A | B | C + l ) l Using the above grammar, show a parse tree and a leftmost derivation for each of the following statements: A=(A+B) * C