Any word in a two$-$letter language $($E$=($i$,$x$,$o$))$ isd written on a transparent strip of paper $.$ when the paper strip is folded into three equal pieces, the letters in the first two pieces overlap in a palindrome manner. In the first two pieces, only letters $\text{'}$i$\text{'}$ and $\text{'}$x$\text{'},$ and in the third piece, only $\text{'}$o$\text{'}$ letters are used $($e$.$g$.$ixxxxiooo$>>$ixx : xxi : ooo$).$ Design a Turing Machine that accepts these special palindrome words.