Please do #2 the answer to #1 are posted with this as well.

1. Given the following NFA over the alphabet {a, b}, --mpo to transform it to a DFA, first construct A-closures of the states of the NFA. Fill out the blanks for state 0, state 1, state 4 and 0 below. (2 points) {0,1} 1} A(0) = A(2) = {2,3} A(4) = A(1) = A(3) = {3} A(O)= {4,3} Next, to get the states of the DFA, we construct a tree as follows. Fill out the blanks in the following tree. (8 points) 12,3} {3,4} 12,3 13,4 The distinct nodes in the above binary tree are listed below (for each level, nodes are taken from the tree from left to right). Fill out the blanks (2 points) OOOOO 12,3} {3,4} {1} 2. The above states are the states of the DFA to be constructed for the NFA given in Question #1. We have the following transition table for this DFA. Fill out the blanks in the table. (5 points) To I a I b | Now replace the five states from top down with 0, 1, 2, 3 and 4, respectively, the transition table of the DFA is of the following form. Fill out the blanks in the table. (3 points) I To a b ] 1 4 4 4 4 Hence, a DFA can be constructed as follows. Fill out the blanks in the DFA (3 points)