3. (20 points) Construct a Turing Machine M to recognize the language L={anb2nn1} (a) Give a Turing Machine Algorithm specification of M (i.e., give an algorithm describing how the stack is used as we have done in class.) (b) Give a full specification of the transition function for M. You can specify this is a transition graph or as a table (I promise this is the last time I will ask you to do this.) 3. (20 points) Construct a Turing Machine M to recognize the language L={anb2nn1} (a) Give a Turing Machine Algorithm specification of M (i.e., give an algorithm describing how the stack is used as we have done in class.) (b) Give a full specification of the transition function for M. You can specify this is a transition graph or as a table (I promise this is the last time I will ask you to do this.)