Give a Turing machine M such that

i$.$ its input alphabet is $0,1$;

ii$.$ M accepts an input string S if and only if S contains twice as many $0$s as it contains $1$s$.$

What is the runtime of your TM$?$

You can define M either by the table of its transition function, or by a labeled graph, or by giving precise

description of its operation in plain English.