Draw a Turing machine that takes a binary number as input, adds 1 to it, and writes that result in place of the input, then goes to an accept state. For example, if the input is 1011, the machine should end up in an accept state with 1100 written where the input was. If the machine overflows and needs to add an additional digit (for example when adding 1 to 111, the result is 1000), that digit should come to the left of the original input