I. Give the Algorithmic description $+$ transitions $+$ encoding of a Turing machine for the language

$,0^i{1}^j$:$i+j$ is odd.

$(100{)}^{+}{110}^{+}$

$(00{)}^n(11{)}^{3n}$

Examples:

$L(0^{**}{1}^{**})$

$\backslash$table$[[$State$,0,1,B$