If we wish to construct a Turing Machine for checking the palindrome of the string of even length. Assume that the input string is ababbaba The process is that the first symbol from the left of the head is read and then compared with the first symbol to the right of the head to check whether it is the same. This process is repeated for all the symbols. If any symbol is found not to match then the machine goes into the HALT state. A diagram of the machine is shown below. Write out the states of the machine at each point in time