a. Give an NFA recognizing the language (01+001+010)* b. Convert this NFA to an equivalent DFA. Give only the portion of the DFA that is reachable from the start state. Minimize the answer to b.