$(1)$ Write Grafstate code for a DFA M that is equivalent to

$N.$

$(2)$ Design DFAs for the following languages:

$\{$w I $($w starts with $0$ and has even length$)$ or $($starts

with $1$ and has odd length$)\}$

$|$ every odd position of $w$ is a $1$