Construct a Turing machine for each of the following languages on alphabet $\{$a$,$b$\}$

$($PRACTICE QUESTIONS$)$

L $=$ L$($aaaa$*$b$*)$

$**$L $=\{$anbman$+$m:n$>=0,$ m$>=1\}$

$1.($GRADED $2$ points$)$ COMPLIMENT of L $=$ L$($aaaa$*$b$*)$

$2.($GRADED $3$ points$)$ L $=\{$anb$2$n : n $>=1\}$

$3.($GRADED $3$ points$)$ L $=\{$w: $|$w$|$ is a multiple of $4\}$

$4.($GRADED $3$ points$)$ L $=\{$ w: n$($a$)$

$$ n$($b$)\}$

$5.($GRADED $4$ points$)$ L $=\{$anbnanbn : n

$0\}$