6. [10 marks] Consider the following State table for a Turing Machine. Note that L is left, R is right, and N means no movement. Assume the only inputs are 0 and 1. State Read Write Move Next State 0 1 R B 1 1 L C B 0 1 L 1 1 R B C 0 1 L B 1 1 N HALT a. Draw the State Transition Diagram for the above table. b. Show the result if we set the Read head in the middle of an infinite tape containing all Os and we started in State A? Describe the movement of the head