Give an implementation$-$level description of a Turing machine that decides the language L$1$ below, over

the alphabet $\{0,1\}.$

L$1=\{$w $|$ w contains three times as many $0$s as $1$s$\}.$

Before you give all the details, please provide a short explanation $(2-3$ sentences$)$ explaining how your

machine will work.

For an implementation$-$level description of a Turing machine, we use English prose to describe the

way that the Turing machine moves its head and the way that it stores data on its tape. We do not

give details of states or the transition function, as we would do for a formal description of the machine,

which would be the lowest, most$-$detailed, level of description.