Can you help me solve this Turing Machine with input w=000 with details of the transition state?

I am needing help understanding the sequence of configurations the machine enters.

Example A Turing machine M, that decides A= {0?"In >0}, the language consisting of all strings of Os whose length is a power of 2. M2 = "On input string w: 1. Sweep left to right across the tape, crossing off every other 0. 2. If in stage 1 the tape contained a single 0, accept. 3. If in stage 1 the tape contained more than a single 0 and the number of Os was odd, reject. 4. Return the head to the left-hand end of the tape. 5. Go to stage 1." 0-1 R -L X-R 9. 12 93 0-R 0 +xR UR 2R -R OR 0R reject 94 --+R