Construct a Turing machine with tape symbols $0,1,$ and B that, when given a bit string as input, replaces the first $1$ that it encounters with a $0$ and does not change any of the other symbols on the tape. Select the correct option below:

A$)($s$0,0,$ s$1,1,$ R$),($s$0,1,$ s$0,1,$ R$),($s$1,0,$ s$1,0,$ R$)$

B$)($s$0,1,$ s$1,0,$ R$),($s$0,0,$ s$0,1,$ R$)$

C$)($s$0,0,$ s$1,1,$ R$),($s$0,1,$ s$0,1,$ R$)$

D$)($s$0,1,$ s$1,0,$ R$),($s$0,0,$ s$0,0,$ R$)$

E$)($s$0,1,$ s$0,0,$ R$),($s$0,0,$ s$1,0,$ R$)$