Write the transition table for the Turing machine. Organise the transitions by state or by the order they're executed $($Section $27\mathrm{.}1\mathrm{.}3).$ Use descriptive state names. Suggestions: Write and test a machine that handles even$-$length inputs and then handles odd$-$length inputs. 'Remove' $($i$.$e$.$ blank out$)$ input symbols as you process them. You should add tests to check your Turing machine, but you won't be awarded any marks for your tests. You don't have to remove your tests before submitting this TMA. In $`$palindrome$\_$tests$`,$ set the debug parameter to $`$True$`$ if you want to see the configurations your Turing machine goes through. Make sure you $**$set it back to $`$False$`$ and run the cell again$**$ before submitting your TMA.