4. (25pt) Consider the following grammar G (nonterminals are upper case, the rest are terminals): P E L L T M M F F F F F E$$ TL +TL E FM *FM E (E) 5. 6. 7. 8. 9. 10. 11. 12. a fff b 0 1 1 (a) (5pt) Show the parse tree for the input: (a+b)*0$$. (b) (10pt) Compute FIRST(X) and FOLLOW(X) sets for all nonterminals X (Syntax: slide 49). Use the algorithm given below and indicate, for each symbol added to a set, the pair (step, prod), where 1