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

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

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