Provide solutions to the following exercises. Turing Machines should be in the form of a hand-drawn transition graph (you may instead use a software tool like madebyevan.com/fam ). Text descriptions and ASCII images will not be accepted. Linz Section 9.1 exercises 1-7 1. Construct a Turing machine that accepts the language L = L(aaaa'b'c 2. Construct a Turing machine that accepts the complement of the language L = L(aana"b' ). Assume that E = (a, b). 3. Design a Turing machine with no more than three states that accepts the language L(a (a + b)"). Assume that E = {a,b). Is it possible to do this with a two-state machine? 4. Determine what the Turing machine in Example 9.7 does when presented with the inputs aba and anabbbb. 5. Is there any input for which the Turing machine in Example 9.7 goes into an infinite loop