Please answer #5!

Theorem 2.20 - A language is a CFL if it is recognized by a PDA.

Unless otherwise noted, the alphabet for all questions below is assumed to be y 10,11. 1. [12 marks This question develops a basic understanding of CFGs and parse trees. Consider the grammar G below. E E T T (1) TT T x FIF (2) F (E) I 2 (3) For each string below, give a parse tree of a derivation in G. (a) 2 (b) 2 2 2 (c) (2+2) x (2))