Given the above NFA, Answer the questions below

$\{1\}($a$)$ transitions to which state$($s$)?$

$\{1\}($b$)$ transitions to which states?

$\{2\}($a$)$ transitions to which states?

$\{2\}($b$)$ transition to which states?

$\{3\}($a$)$ transitions to which states?

$\{3\}($b$)$ transitions to which state?

What NFA states belong to the DFA initial states?

Which are accepting states in the final DFA?

How many states are in the equivalent final DFA?

Which regular expression describes the equivalent DFA?

a$*$b

a$*$ U a$*$b

a$*$ U b

a$*$ U ab