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\}$

$(4)=$

$(1)=$

$(3)=\{3\}$

$()=$