points$]$ Consider the following language, defined over the alphabet $=\{a,b\}$

$L=\{w|win{}^{**},w=a^n{b}^{2n},n1\}.$

Define a Turing machine $M$ such that $L(M)=L$ and $M$ stops for every possible input in ${}^{**}.$ Graph$-$

ically represent the transition function of $M$ and provide an informal discussion of the computation

associated with each state of $M.$