Purpose: Demonstrate the equivalence of regular languages and regular

expressions.

Course$-$Specific Learning Outcomes: $1($a$)($partial$)$ Given an NFA

M$,$ create a DFA or regular expression that accepts L$($M$).$

$1.13$ points Using the methods discussed in the video and the text, convert the following regular expression into an NFA.

$(01)$

$(0\backslash$cup $1)$

Your NFA should have numerous $\backslash$epsi transitions that would normally

seem unnecessary, but are inserted when using this method.