Section $2\mathrm{.}1$ Deterministic Finite Acceptors $($DFA$)$

Section $2\mathrm{.}1-$ attempt parts I and II for

Find dfa's for the following languages on $=\{a,b\}.$

$($PRACTICE QUESTION$)**$ all strings with and even number of $a\text{'}$s $-2\mathrm{.}1$ Question $3$

$($PRACTICE QUESTION$)$ All strings with an even number of a$\text{'}$s and an odd number of b$\text{'}$s

$($GRADED $3$ points$)$ All strings with any number of $a\text{'}$s and exactly $3b\text{'}$s

Find dfa's for the following languages on $=\{a,b\}.$

$($PRACTICE QUESTION$)L=\{w$:$|w|mod5=0,|w|5\}L=\{w$::$n0\}\{ab{a}^n$:$n0\}L=\{a^n$:$n0\}\{b^{n}a$:$n1\}L=\{b^n$:$n0\}\{bab{a}^n$:$n0\}$