TM - Turing Machine

5.. You are to provide the algorithm and the TM( the transition diagram) for the following question. a. Input ; a sequence of O's and 1's Output: replace every other 1 with a blank, starting with the first 1 found, and leave O's alone. Example Input : 111 Output : b1b Example Input : 10110010 Output : b01b0010 :00 Example Input Output :00