Answer Happy

Please do not just copy and paste other people's work. Original
work with explanations would be greatly appreciated.
6. Give the state diagram for a Turing machine that decides each of the following language over = {0,1}: a) Lo= {w: w contains both the substrings 011 and 101} b) L7= {w: w contains at least two O's and at most two l’s}