Consider the following grammar for a simple programming language: repeatstrnt ::- repeat ( expr ) stme> : := print expr> ; term ::- factor factor : := id 1 term | number multop factor I- factor l ( expr ) number ::-digle> 1 number ::= 0 I 1 I 2 I 3 I 4 I 5 I 6171819 Create a state transition table for the scanner of this language using an adjacency table. Assign a number to each of the input symbols, and a number to each of the states. Use a comma as a separator. Remember that you need to have the same number of commas in each row, just put a space between the commas for an empty table cell. Also submit C data structures to implement the transition table. Consider the following grammar for a simple programming language: repeatstrnt ::- repeat ( expr ) stme> : := print expr> ; term ::- factor factor : := id 1 term | number multop factor I- factor l ( expr ) number ::-digle> 1 number ::= 0 I 1 I 2 I 3 I 4 I 5 I 6171819 Create a state transition table for the scanner of this language using an adjacency table. Assign a number to each of the input symbols, and a number to each of the states. Use a comma as a separator. Remember that you need to have the same number of commas in each row, just put a space between the commas for an empty table cell. Also submit C data structures to implement the transition table