Section $3\mathrm{.}2$ Regular Expressions and Regular Languages

$=\{0,1\}$

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$.L({00}^{**}+{010}^{**}{1}^{**})$

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

$5$c$.,L(((00I^{**}{)}^{**}I{)}^{**})$