Let $M_1$ be a deterministic finite automaton:

$($a$)$ Draw the state diagram for $M_1.$

$($b$)$ Trace the computations of $M_1$ that process the following strings:

i$.$ abaa

ii$.$ bbbabb

iii. bababa

iv$.$ bbbaa

$($c$)$ Which strings from $(2$b$)$ are recognized by $M_1?$

$($d$)$ Give a regular expression for $L(M_1).$ FIND THE ANSWER?