For each problem where you are creating a Turing Machine $($TM$),$ don't forget to write it as a septuple as well. You should create a document with septuple with transition functions and create jff files for actual TMs$.$ You should submit a zip file with all jff files and the document to Blackboard. For each language assume that only the symbols mentioned are in the input alphabet.

$1.$ Using the TM below, write out the instantaneous descriptions for the following string. For each string, determine if the string is accepted or rejected by the TM after you list the complete set of instantaneous descriptions. Use the symbol to represent a move from one instantaneous description the next. To get the symbol you can do the following: on a Mac, type Command$+$Control$+$SpaceBar and click 'Math Symbols' in the left bar and on row $26,$ you should see the symbol. On a Windows machine, you should be able to hold down the ALT key and type $\text{'}195\text{'}$ with the keypad and the symbol should show. Suggestion: Copy it once you have it and paste it when needed. $(5$ points cach$).$ I apologize early for the length of some of these