$2.$ Give the state diagram of a Turing machine that decides the following

languages over $=\{0,1\}$:

a$.\{$w: w contains both the substrings $011$ and $101\}$

b$.\{$w: w contains at least two $0$s and at most two $1$s$\}$

$3.$ Give the state diagram of a Turing machine that accepts the following

language over $=\{0,1\}$:

$\{0$m$1$n: m $>$ n $>=0\}$