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 b T a b S {0,4,5) S S F F 1 M F 0 F J M M L F {3,6,7} {2,4,5) F M . M M Then convert the table representation to a digraph representation as follows. Fill out blanks in the following digraph. (3 points) S a a.b , a.b |