PLEASE: DO NOT UPLOAD THE SAME OLD ANSWER ALREADY POSTED IN CHEGG FOR THIS SAME QUESTION, BECAUSE THAT ANSWER IS NOT CORRECT! WRITE WITH LEGIBLE LETTER, AND IF YOU ARE NOT SURE ABOUT YOUR ANSWER DO NOT WRITE IT, THANK YOU

Question 1. (15 points) Consider the following LL (1) grammar with starting symbol S. S (S T) T FT F-id F num a) Compute the First and Follow sets of all non-terminals (5 points) b) Construct the LL (1) parsing table for the grammar (5 points) c) Show step-by-step (content of stack and input string, as well as the production taken) how the following string is parsed: (2030+ a) (5 points)