PLEASE ANSWER THIS!!!!!

Design a TM that accepts the language. $L=\{1^n{0}^n{1}^n|n1\}w=\{101,110011\}$

Design a TM consist of even number of $0\text{'}$s and odd number of $1\text{'}$s$.$ And the string starts and ends with zero. $W=\{010,01010\}$

Design a TM that accepts the language. $L=\{0^n{1}^n|n1\}w=\{0011,00011\}$

Design a TM that the first symbol $(0$ or $1)$ and checks that it does not appear elsewhere in its input. TM accepts the language ${01}^{**}+{10}^{**}.W=\{1000,0111\}.$

Design a Turing Machine to accept the language. $L=\{w^R|win(0+1{)}^{***}\}$ and simulate its action on the input $w=\{0110,011110,0011\}.$