Need help!! please help

c) Is the grammer LL(1)? If so, show parse table, if not , identify a prediction conflict

- w dype llanc.) 2.12 Consider the following grammar: Chapter 2 Programming Language Syntax G S $$ S - AM MSI E | A] | B (a) Describe in English the language that the grammar generates. (b) Show a parse tree for the string a b a a. () is the grammar LL(1)? If so, show the parse table; if not, identify a prediction conflict