Theory of Computation question regarding Turing Machines

5. Consider the Turing Machine defined below (same as TM M2 in text book). q5 q1. 0 x, R 0 x, R q q4 accept reject Give the sequence of configurations (state, tape-content, head-location) that M2 enters when the tape initially contains each of the following inputs. Presume the head-location starts at the first non character on the tape If the TM does not halt, just list the configurations up through the first loop repetition. a. Oxx0 b. 0x