Give the state diagram of a Turing machine that decides the following languages over {0,1}:

a. {w : w contains both the substrings 011 and 101}

b. {w : w contains at least two 0s and exactly two 1s}