Name and CUNY ID#:

Problem $1,(7$ points$)$ Let $L_7$ be the set of strings over the alphabet $\{a,b\}$ with an even number of $a\text{'}$s and an odd number of b$\text{'}$s$.$ Let $L_2$ be the set of strings over the alphabet $\{a,b,c\}$ with cither an even number of $a\text{'}$s$,$ an odd number of $b^{\text{'}}s,$ or an even number of $c^{\text{'}}s.$

$($a$)$ Draw the state diagram of a deterministic finite state automators that accepts $L_1.$

Answer:

$($b$)$ Draw the state diagram of a nondeterministic finite state automaton that accepts $L_2.$

Answer: