$1.$ Give the implementation$-$level description $($English prose description of how the tape head moves and what is written to the tape$)$ of the Turing machine that decides each of t XJ$08$ he following languages: a$.$ L$,$ described by the regular expression ba$*($bb$)$ a b$.$ L$\}=\{$we $\{0,1\}|$ w is a palindrome of even length$\}$