12:11 AM oo T-Mobile 1 90% cse.csusb.edu Write a program that does the following 1 Reads a grammar. 2 Finds all FIRST (X) sets, following algorithms on pg 220 3. Finds all FOLLOW(A) sets following algorithms on pg 222 You may write the program in any language that is supported by the computers in the lab but C++ is preferred INPUT A grammar G. OUTPUT: The list of all productions in G The FIRST (X) and FOLLOW(A) sets of G DELIVERABLES: Program source code, with internal documentation Test results for grammar G417 and at least one other grammar. NOTES: Follow the textual conventions on pg. 166 of text A is a non-terminal. X is a grammar symbol (terminals or non- terminal). In addition we will use the following conventions 1 all terminals will be single characters. 2 all non-terminals will be single letters. 3 epsilon (the empty string) is e 4 the produces symbol in productions is 5 end of input end of section symbol is