Draw the state-transition diagram for a Turing Machine M that decides each of the following languages. That is, M is supposed to accept all strings in the language and reject all strings not in the language (it cannot loop forever on any input). Assume that the input alphabet is = {0,1} and tape alphabet is U {O). Feel free to define more tape symbols if necessary. 2. B-(c) 3, C= {0} 4. D= {1)