Design a state transition diagram of a (deterministic) Turing machine which converts a positive decimal number into the same number in binary notation. Hint: Observe that the conversion can be done by repetitive reduction of the decimal number by one and an increment of the binary number also by one. Also, it is more convenient to create the binary number on the left side of the decimal one (why?)