$\text{Example}:$ Design a Turing machine that copies strings of $1’s$. More precisely, find a machine that performs the computation
$q_0q\vdash^*q_fww,$
for any $w\in\{1\}^+$.
What happens in Example if the string $w$ contains any symbol other than $1?$
