Format Tools Table Window Help Document View Tell me Layout Upc Som aval References Mailings Review ' A EE 1 AaBb Odee Aaabccdee Normal No Song Heading 1 AY 1. [12 points) This question develops a basic understanding of CFGs and parse trees. Consider the grammar G below. A- A+B B (1) B - CIC (2) c (A) 5 (3) For each string below, give a parse tree of a derivation in G. (a) 5 (b) 5 x 5+5 (c) ((5 x 5) + (5 x 5)) 2. [5 points) We saw in class that the sets of both regular and context-free languages are closed under the union, concatenation, and star operations. We also saw that the regular languages are closed under complement. In this question, you will investigate whether context-free languages are closed under intersection. Use the languages A = {"min) and B = {a""e" m,n 20) to show that the class of context-free languages is not closed under intersection. You may use the fact that the language C = {a"8"c" in > 0) is not context.free. nglish (United States) Focus tv 0 A w