Create Turing Machines that perform the following operations $($diagrams and state transitions$)$:

a$.$ Accept all strings formed with the $\{0,1\}$ alphabet and convert the $\text{'}1\text{'}$s in substrings formed by two or more consecutive $\text{'}1\text{'}$s to $\text{'}0\text{'}$s$,$ leaving everything else unchanged. $($For example, after the machine completes processing the input $...0101101110101...,$ the output should be $...010000000101...)$

b$.$ Start processing from state $q0$ at any tape point, and for any tape input, it should never transition to a halting state.

c$.$ Transition to a halting state for any tape input.