A Turing machine $M$ decides a language $L$ if

$1$

$M$ ACCEPTS every string winL, and

$2$

$M$ REJECTS every string $wi\frac{n}{b}ar(L).$

Recall that $\frac{?}{\text{b}\text{a}\text{r}}(L)={}^{**}-$L$.$

Create a Turing machine $M_1$ to decides the language of binary strings that contain at

least $2$ consecutive $1s$ and an even number of $1s.$

$(2)$

Create a Turing machine $M_2$ to decides the language of binary strings that contain at

least $2$ consecutive $1s$ or an even number of $1s.$

You must comment you transitions to receive full credit.

You must include all qr logic to get full credit.