Give implementation-level descriptions of Turing machines that decide the following languages over the alphabet {0,1}.

^Aa. {w| w contains an equal number of 0s and 1s}

b. {w| w contains twice as many 0s as 1s}

c. {w| w does not contain twice as many 0s as 1s}