Please use phython 2.7 if there is any code required.

2. (15 points) Create a Turing machine which works with only 3 symbols: 0,1 and (blank), and which can determine whether the number of Os and 1s in a block are the same. In other words, the input tape is blank except for a block of Os and 1s. You may assume that the Turing machine head is pointing to the leftmost element of the block. If the number of Os and 1s in the block are the same, the Turing machine should halt and the final tape should be empty. If the numbers are different, the Turing machine should halt on a non-blank cell. Submit the state-transition graph for your Turing machine together with a non-trivial, sample n of your choosing ru 2. (15 points) Create a Turing machine which works with only 3 symbols: 0,1 and (blank), and which can determine whether the number of Os and 1s in a block are the same. In other words, the input tape is blank except for a block of Os and 1s. You may assume that the Turing machine head is pointing to the leftmost element of the block. If the number of Os and 1s in the block are the same, the Turing machine should halt and the final tape should be empty. If the numbers are different, the Turing machine should halt on a non-blank cell. Submit the state-transition graph for your Turing machine together with a non-trivial, sample n of your choosing ru