Any word in a two$-$letter language $($E$=(0,8))$ isd written on a transparent strip of paper $($e$.$g$\mathrm{.}08800880).$ When the paper is folded in half, the letters overlap without any errors $($e$.$g$.0880$ : $0880>>0880).$ The paper is folded in half once again.On the transparent paper, the letter overlap again $($e$.$g$\mathrm{.}08$ : $08>>08).$ Let's call this a double palindrome words. Design a Turing machine that accepts these double palindrome words.