Question: Create NFA (Nondeterministic Finite Automata) for
Part a: The language 0*{01}* with three states
Part b: The language {?, 0, 01+} with at most three transition rules
Please show me all the working and provide right Nondeterministic finite automata.