3) (10 points) Given the grammar from question 2, show a left-most derivation (step by step) and draw the parse tree for the following statement. 4) (10 points) Remove the recursion from the following grammar. Clearly add proper comments/explanations for your steps S>AaBb B >bb C->C 5) (10 points) Use left factoring to resolve the pairwise disjointness problems in the following grammar. Clearly add proper comments/explanations for your steps A-aBc ac a B b a 6) (12 pts) Decompose the following grammar into 6 rules. E-> E + T | E * TIT T(E)l id 7) (24 pts) Show a complete bottom-up parse, including the parse stack contents, input string, and action for the string below using the parse table. (Hints: think about how I went through this in class.) (id +id) * id 8) (10 pts) Show a rightmost derivation for the string above, and show how the bottom-up parse you completed in step 7 correctly finds all of the handles for the input string above