Consider the following grammar: 1. S A$ 2. A XA x 3. A C 4. B y By 5. B C 6. CzBZ 7. CW A w 8. Ca [3 marks each] a) Determine the terminals and non-terminals of this grammar. b) Illustrate the derivation of the string xzzx$ (with each production used at each step). c) Determine the first and follow sets for each non-terminal of the grammar. d) Find the parse table for the grammar (use the production number to fill in the parse table cells instead of the whole production for simplicity) and determine whether it is LL(1) with justification. e) Illustrate the steps that your parser would take to parse the string xzyyzx$