Need solution for number #2 & #3.

l. Given the grammar G = ((ERT).(a, b). E.P) with production rules. P. as follows: Give parse trees for each string: (a) e x (a + b (b) (a+b) (a + c) 2. Give a leftmost derivation for each expression in question 1 3. Give a rightmost derivation for each expression in question 1 What is the difference between a right-most derivation and a left-most derivation? Explain and give examples. List and explain two properties of the definition of a parse tree. 6. Use the Infix to Postfix algorithm to convert the following expression to Postfix: a +b) (a + 7. Use the Postfix grammar to construct a parse tree for the following postfix expression: 23.4.6+-+3.9/-- 1.5