step by step soluction and clear sulotion i need to understand it.

For the following questions, assume the only tape symbols are 0, 1 or B; assume S0 is the initial state; assume L and R refer to the direction in which the read/write head moves; and assume the initial input is a string of 0s and 1s, surrounded by blanks (B) on either side: A) Design a Turing machine that, given an arbitrary bit string, will append a single 1 to the rightmost end of the string. B) Design a Turing machine that, given an arbitrary bit string, replaces the first two consecutive 1s with 0s.