Consider the following grammar:

G → S $$
S → A M
M → S | ∈
A → a E | b A A
E → a B | b A | ∈
B → 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.