When proving a language $$ is not regular, the method is

$$ Pick a string $$ in $$ of length $$

$$ Show that for any division of $,$ where $=$ with $||>0$ and $||$

$$ There is some value $0,$ such that $!.$

With the above method, we want to show the following languages are not regular, which $$ and $$ will

complete the proof?

$(1)=\{0"1$# $|\}$

A$.=0$$ $1$$ $,=2$

B$.=0$$ $1$$ $,=$

C$.=0$$ $1$$ $,=1$

D$.=0$$ $1$$ $,=0$

$(2)=\{|$ in $\{0,1\}\}$

A$.=0$$ $0$$ $,=2$

B$.=0$$ $10$$ $1,=0$

C$.=0$$ $10$$ $1,=2$

D$.=1$$ $001$$ $,=3$