2. Given the following NFA over the alphabet {a,b}, to transform it to a DFA, first construct -closures of the states of the NFA. Fill out the blanks for state 0 , state 1, state 4 and below. (2 points) (0)=(2)={2,3}(1)=(3)={3} Next, to get the states of the DFA, we construct a tree as follows. Fill out the blanks in the following tree. (7 points) 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)