DFA for the language L $=($w starts with an a and contains the substring abb$)[5$ marks$]$ Consider the following language:

$L=\{win\{0,1{\}}^{**}|w$ has $at$ least twice $as$ many $1\text{'}sas0\text{'}s\}$

Use the pumping lemma to prove that $L$ is non$-$regular and show every step in your proof.