$14$ points Let L be the set of strings that end in either $00$ or $001.$ Below

is a DFA M that accepts L$.$ As usual, you will find the grafstate code

for this figure at the end of the $.$tex document.

$2670$E$\_$WS$6$fig$1.$png:

fig $1$

:$+$ dfa

title Strings ending in $00$ or $001$

Q$=\{$q$1,$q$2,$q$3,$q$4\}$

S$=\{0,1\}$

d$($q$1,0)=$q$2$

d$($q$1,1)=$q$1$

d$($q$2,0)=$q$3$

d$($q$2,1)=$q$1$

d$($q$3,0)=$q$3$

d$($q$3,1)=$q$4$

d$($q$4,0)=$q$2$

d$($q$4,1)=$q$1$

q$0=$q$1$

F$=\{$q$3,$q$4\}$

done.

Show how to modify M to create an NFA that accepts L$,$ using the

method described in the video and text.