Give the state diagram of a Turing machine that decides the following languages over Σ={0,1} : a. {w:w has prefix 101} b. {w:w has suffix 011} c. {w:w contains the substrings 011}