a$(5$ marks$)$ For each of the following languages, draw the state diagram of a deterministic finite

automaton that accepts the language.

$($Note: This means that your finite automaton should accept every string in the language and

should not accept any strings that are not in the language.$)$

$($Note: Deterministic means that there is exactly one transition defined for each input symbol

in each state. We will discuss nondeterministic finite automata later.$)$

$($a$)L_1=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{0,& 1{\}}^{**}|n_0(w)\end{array}$ and $n_1(w)$ are both odd