[1.5pt] Give a formal definition (e.g., a state transition diagram) of a Turing machine that recognizes the set of all binary strings of odd length that have a 1 in the center position