Turing Machines
1.Give both a high-level algorithm and an implementation (\bubble diagram") of a Turing machine for the language. Use the ` notation to show the computation sequence (con gurations) for the strings 010 and 1010 using your TM.
2.Give both a high-level algorithm and an implementation (\bubble diagram") of a Turing machine for the language. Use the ` notation to show the computation sequence (con gurations) for the strings 000 and " using your TM.
3.Give both a high-level algorithm and an implementation (\bubble diagram") of a deterministic Turing machine that accepts L = fw 2 fa; b; cg j jwja < jwjb < jwjcg.
4.Give both a high-level algorithm and an implementation-level (\bubble diagram") of a Turing machine for the language:
L = fw 2 fa; bg j w contains aa and ends with bag
5.Give both a high-level algorithm and an implementation-level (\bubble diagram") of a Turing machine for the language:
L = fw#x j w; x 2 fa; bg and w is a substring of xg