1. Give an implementation-level description of a Turing Machine which recognizes the language an am-anm : n, m EN) . Show how the tape looks at each stage of computation on the input #4 x a (which should be accepted). a 2. Give a formal state digram of a Turing Machine which recognizes the language " (You can use the "#" symbol to recognize the beginning of the tape.) 1. Give an implementation-level description of a Turing Machine which recognizes the language an am-anm : n, m EN) . Show how the tape looks at each stage of computation on the input #4 x a (which should be accepted). a 2. Give a formal state digram of a Turing Machine which recognizes the language " (You can use the "#" symbol to recognize the beginning of the tape.)