Please see the picture here:

Consider the following grammar: G rightarrow S $$ S rightarrow A M M rightarrow S | elementof A rightarrow a E | b A A E rightarrow a B | b A | elementof B rightarrow b E | a B B (a) Describe in English the language that the grammar generates. (b) Show a parse tree for the string a b a a. (c) Is the grammar LL(1)? If so, show the parse table: if not, identify a prediction conflict