Draw a Turing Machines that decide the follow- ing languages over the alphabet {0,1}. Please provide 5 input strings to test each Turning Machine. I am having trouble understainding how to draw Turing Machines so PLEASE sketch the steps on drawing the Touring Machine.

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

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

C. {w#w#w | w ? {0,1}*}