Parts $a,b,$ and $c-$ see the supporting documentation for assistance with parts a and $b,$ part $c$ will be graded

Find $($draw$)$ dfa's that accept the following languages. $($show all your work$)$

START WITH nfas, and then convert to dfas Reduce the number states of the dfa

$5$a$.($PRACTICE QUESTION$)L({00}^{*}+{010}^{*}{1}^{*})$

$5$b$.($PRACTICE QUESTION$)L(01(0+01)*(0+00))$

$5$c$.($GRADED $3$ points$)L((({001}^{*}{)}^{*}1{)}^{*})$

need help with $5$c