Provide a formal definition of the states, transition function, and alphabet for a Turing machine that accepts strings reading the same forwards and backwards. Explain the step-by-step execution of the machine on the input string '101'.