$5.$ Give an implementation$-$level description of a Turing machine that decides the

language L $=\{$w $|$ w contains twice as many $0$s as $1$s $\}$ over the alphabet $\{0,1\}.$

$6.[3$ marks$]$ Consider a Turing machine where the r$/$w head is initially moved to a random tape square. Assume $=\{0,1\}.$ Give an implementation$-$level description of such a Turing machine that accepts if and only if the initial input placed on the tape was non$-$empty.