$($a$)$ Provide an NFA recogn$$z$$ng the language $(01U001U010)*.$

$($b$)$ Convert this NFA to an equivalent DFA, giving only the portion of the DFA that is

reachable from the start state.

Figure $3$:

Convert the following finite state automata $($Figure $3)$ to a regular expression.

Please draw it out