Question 11 (a) Assume you have a Turing machine defined by the following table: Read State Write Move Change Write Move Change Write Move Change Blank state state state Halt 0 Right That is, it has two possible states (A and Halt), it can read/write 1s, Os and Blanks, and it moves the read/write head to the right only. Assume you have an input tape as follows, where the read/write head is located at the left end of the tape: Head Tape: 1 1 Blank 1 Blank Draw the contents of the tape after the execution of the program (i.e., when it reaches the "Halt" state) described by the table above using the particular input on the tape, and indicate the final location of the head. The machine starts in state A. Your result should be on a tape with 8 entries. 5 marks] Total for Question 11: 5 marks]