Turing Table to State Diagram Please

Question 3: Turing Machines [3.5 points] As we discussed in class, a Turing machine can be represented either as a Table or as a State Diagram Below you will find a table for a Turing machine State / Input _.Right. 1_. Right, 2 _. Left, 5 a, Right, 1 ?b. Right, 1 ?-, Left, 3 a, Right, 2| b. Right, 2 |_. Left, 4 Left, 7b, Left, 6_. Lef, -5 a, Left, 6 _ Left, 7_ Lef, -5 AcceptAccept Accept Reject a, Left, 7 b. Left, 7_.Right, 0 Reject Reject Note that states 5 and 6 are special states. In both of them, the machine halts on any input. In state 5 the machine halts in an 'accept' state. In state 6 the machine halts in a 'reject' state. This means that if the machine ends up in state 5, it 'accepts' the input string it has processed. If the machine ends up in state 6, it 'rejects' the input string it has processed. As you will see, this machine accepts certain kinds of strings and rejects others. 3.1. Draw the equivalent State Diagranm (1 point)