1. Given the following NFA over the alphabet {a, b}, -- Obero 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 below. (2 points) A(0) = A(2) = {2,3} A(4) = A(1) = A(3) = {3} N(O)= Next, to get the states of the DFA, we construct a tree as follows. Fill out the blanks in the following tree. (8 points)