Consider the context-free grammar with the following rules (S, A, B are nonterminals, S is the start nontermipal and a, b, c are the terminals): S + Ba A A-+ aA | Bc 6 B + bB ca (a) (3 marks) Determine the sets FOLLOW(S), FOLLOW(A), FOLLOW(B), as well as the sets FIRST(a) where a is any of the right sides of the productions. For each element z belonging to the set FIRST(BaA) give a derivation starting from Ba A of a string w with first symbol z (or in case E FIRST(BaA), a derivation of e from BaA). For each element z belonging to the set FOLLOW(B) give a derivation starting from S of a string w where z occurs directly after B. The derivations are not required for the other follow/first sets. (b) (2 marks) Does the grammar allow the use of recursive-descent parsing? Justify your answer - please be specific and give a detailed