Given the following regular expression over the alphabet {a,b}, (ba)(a+b) to transform it to a regular grammar, we first transform it to an NFA as the one shown below. Instead of converting this NFA to a regular grammar directly, we convert it to a DFA first and then convert the DFA to a regular grammar (0)={0,1,3}(1)={1,3}(2)={2}(3)={3}(4)={4}()= and build the following tree, (3 points) so that the following nodes of the tree can be used to build a DFA. Fill out the following blanks and blanks in the above tree. {0,1,3} (0.75 points) Then convert the table representation to a digraph representation as follows. Fill out the blanks in the following digraph. (1.25 points) Regular expression of the above FA is (2 points) which is equal to the given regular expression (ba)(a+b). (Why?)