Draw the state machine diagram for the Turning machines that decide the following languages over the alphabet {0,1}:

a) {w | w contains twice as many 0s as 1s}

b) {w | w does not contain twice as many 0s as 1s}