ONLY QUESTION 5!!! Posted question 4 for context.

4. With the selected nodes from the above tree, we build a DFA by constructing the following transition table (the table on the left), and renaming the states as S (start state), I, J, K, L and M: (7 points) T a b T a b S (0,4,5) S S F 0 F 1 M F D 0 F J M M K F {2,4,5) L M F (3,6,7) M M M Then convert the table representation to a digraph representation as follows. Fill out blanks in the following digraph. (3 points) a.b 5. However, we don't need the portion circled in the above digraph representation of the DFA (why?). By removing that portion, the DFA is like the one shown on the left side of the following figure S- 0 0 1 JA K OL L 101 By constructing production rules from this FA, we get the production set of the regular grammar on the right side of the above figure. Fill out blanks in the above figure. (6 points)