Draw state diagram of Turning machine L = {w | w contains twice as many 0s as 1s}. Indicate the last state from which the q_reject state is reached. Also convert the first element of the string to...

Draw state diagram of Turning machine L = {w | w contains twice as many 0s as 1s}. Indicate the last state from which the q_reject state is reached. Also convert the first element of the string to blank and do it, not by assuming that string starts with blank symbol , but you can assume blank at the end of the string. (eg 001B , not B001B. In second example you are assuming blank before the string so wrong)