"For each regular expression, $(1)$ determine if the following set of strings will be accepted or rejected: $\{$student submitted image, transcription available XA$04$ below, $00,11,0101,000111\},(2)$ use appropriate notation to describe the language that is expressed by the regular expression, $(3)$ draw an NFA that matches the regular expression, and $(4)$ draw a DFA that matches the regular expression. Assume that

student submitted image, transcription available below$=\{$a$,$ b$\}$for each one.

$($a$)($a$+$ab$)*$

$($b$)$ a$*$b$*$

$($c$)$ a$($a$+$b$)*$b$"$