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 2, B-(e) 3, C = () 4, D= {1}