I am not sure if my answers are correct. Can you also give some explanation as to how the states are included in regards to ^. That confuses me.

1. Given the following regular expression over the alphabet (a, b}, (ba)*a + b(ab)* to transform it to a regular grammar, we first transform it to an NFA as the one shown below. ab To ba 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 (why?). So we construct A-closures of the above NFA, A(0) = {0,1,3} (1) = {1,3} A(2) = {2} A(3) = {3} (4) = {4,5,7) A(5) = {5,7} A(6) = {6} A(7) = {7} 7(0) = 0 and build the following tree, (3 points) A(O) = {0,1,3} {7} {2,4} Q 0 K1, 5, 7}] do {1} || 0 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} {7} {2,4} (2 points) 10:13 | | 12.95 $1.5.7. To zpont