1. Give an NFA recognizing the language (01+001+010)^*.
   Note: The textbook uses the symbol '∪' for union, while I use '+'.


2. Convert this NFA to an equivalent DFA. (Give only the portion of the DFA that is reachable from the start state.)