$(*)$ A Turing machine M $!\{$decides$\}$ a @lang L if

$>>[1]$ M ACCEPTS $*\{$every$\}$ string w$\backslash$inL$,$ and

$>>[2]$ M REJECTS $*\{$every$\}$ string w$\backslash$in~L$.$

$//$

$[$nb$]$ Recall that ~L$=\backslash$S$*-$L$.$

$//$

$(1)$ Create a single tape Turing machine M$\_1$ to decides the @lang of binary strings that contain at least $2$ consecutive $*\{1\}$s $!\{$and$\}$ an even number of $\backslash [1]$s$.$

$\backslash$;

$(2)$ Create a single tape Turing machine M$\_2$ to decides the @lang of binary strings that contain at least $2$ consecutive $*\{1\}$s $!\{$or$\}$ an even number of $\backslash [1]$s$.$

$\backslash$;