: $1($a$)($partial$)$ Given an NFA

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

$1.13$ points For any string w in $\backslash$Sigma

$$ and symbol a in $\backslash$Sigma $,$ let na$($w$)$ denote

the number of times a appears in w$.($We will be using this notation

regularly this semester.$)$

Construct a regular expression describing the following language over

the alphabet $\{0,1\}$

L $=\{$w $|$ n$0($w$)1$ mod $3\}.$

Hint: First try constructing a regular expression accepting all strings

with w with n$0($w$)$ is divisible by $3.$