$\text{Example}:$ Design a Turing machine that copies strings of $1’s$. More precisely, find a machine that performs the computation
$q_0w \vdash^* q_fww,$
for any $w\in\{1\}^+$.
Give convincing arguments that the Turing machine in Example does in fact carry out the indicated computation$.$
