Design a subroutine to move a TM head from its current position to the right, skipping overall $0's,$ until reaching a $1$ or a blank. If the current position does not hold $0,$ then the TM should halt. You may assume that there are no tape symbols other than $0,1$ and $B$ $\text{(blank)}.$ Then use this subroutine to design a TM that accepts all strings of $0's$ and $1's$ that do not have two $1's$ in a row$.$
