2. Consider the following LL grammar: S + aB BAE A + BAAS B + BB bS (a) Compute the FIRST and FOLLOW sets for each nonterminal. (b) Using the FIRST and FOLLOW sets, generate the predictive parsing table. (c) Show the parsing action (including the matches, stack, input and action columns) for the string: baab$. Note that if your parsing does not work (which it should for this one, unless I've made a mistake), you should simply show the parsing action up to the point where it gets stuck