Turing Machine Construction and reductions Please show the graph of the machine with all edges labeled and please provide a brief description of the purpose of the states in your machines. You must use JFLAP to For each TM you build, please add a BRIEF English description of how it operates. Make your English description as clear as possible! Please note - this one may take some time so please get going on it SOON. 2. Construct a TM that expects a string of 0's and 1's and interprets the value as some binary integer X. Your TM should halt and end with the binary representation of 2*X on the tape. For example, if the machine was started with 1101 (binary 13) on the tape then it would halt with 11010 on the tape (binary 26). If the machine was started with 1010 (binary 10) then it would halt with 10100 (binary 20) on the tape