$[5$ pts$]$ Draw a Turing Machine that accepts the set of all bitstrings that have $"0"$ in all the even$-$numbered positions starting with position $0$ at the left. So the TM should accept and reject strings such as the following $($I$)$ show you all strings of length $0-5$ bits$).$ The table contains hints to help you $($note bold underlining$).$ Idid this in $2$ states, but if you want to use more that's OK$.$

$\backslash$table$[[$String$,$Result,String,Result,String,Result,String,Result$],[$Empty$,$reject,$9090,$Ascept,Qeegen,Accept,$10000,$reject$],[0,$Accept,eeen,Accept,$00001,$reject,$10001,$reject$],[1,$reject,$0010,$reject,ge$919,$Accept,$10010,$reject$],[00,$Accept,$0011,$reject,$60011,$reject,$10011,$reject$],[01,$Accert,$0100,$Accept,$00100,$reject,$10100,$reject$],[10,$reject,$0101,$Accept,$00101,$reject,$10101,$reject$],[11,$reject,$0110,$reject,$00110,$reject,$10110,$reject$],[00a,$Accept,$0111,$reject,$00111,$reject,$10111,$reject$],[001,$refect,$1000,$reject,Q$1$e$0$e$,$Accept,$11000,$reject$],[010,$Accent,$1001,$reject,$01001,$reject,$11001,$reject$],[011,$reject,$1010,$reject,@$1919.,$Accept,$11010,$reject$],[100,$reject,$1011,$reject,$01011,$reject,$11011,$reject$],[101,$reject,$1100,$reject,$01100,$reject,$11100,$reject$],[110,$reject,$1101,$reject,$01101,$reject,$11101,$reject$],[111,$reject,$1110,$reject,$01110,$reject,$11110,$reject$],[,,1111,$reject,$01111,$reject,$11111,$reject$]]$