Question: Design a Turing machine with tape symbols 0, 1 and B that given a bit string as input, replaces all but the leftmost 1 on the tape with 0s and does not change any of the other symbols on the tape. Please explain your answer and also provide examples