3. Consider the grammar S-ALCIDCA A-a Ad EIC Eela C+02 D-dD2 3.1. Show that the grammar has a predictive recursive descent parser. You should show that the conditions of predictive parsing apply for every non-terminal. 3.2. Write parse_$0, parse_A0). Your parser should follow the general model of predictive parser that we saw in class. In particular, for non-terminals that can generate 2, the parser should check the FOLLOW set before choosing to parse the righthand side that generates 2. 3.3. Give a full execution trace for your parser from part 3.2 above on input a a dd. 3. Consider the grammar S-ALCIDCA A-a Ad EIC Eela C+02 D-dD2 3.1. Show that the grammar has a predictive recursive descent parser. You should show that the conditions of predictive parsing apply for every non-terminal. 3.2. Write parse_$0, parse_A0). Your parser should follow the general model of predictive parser that we saw in class. In particular, for non-terminals that can generate 2, the parser should check the FOLLOW set before choosing to parse the righthand side that generates 2. 3.3. Give a full execution trace for your parser from part 3.2 above on input a a dd