implement a Turing Machine for the

set of all string over the language given by

$1>\{0^$n$1^$n$/$n$>=0\}$

$2>\{$WxW$^$r $|$ W$=\{$a$,$b$\}*,$x$=\{0,1\}$

$3>\{0^$n$1^$m $|$ n$>=0,$ m$>$n$\}$

$4>\{0^$n$1^2$n$|$ n$>=0\}$

refer to example and no chatgpt answers, solve all separately$\backslash ,$