2. (Implementation-Level to Low-Level) (a) Give a state diagram of a TM whose implementation-level description is below. The input alphabet of this TM is {a,b} and the tape alphabet is {a,b, }. Input : String w 1. If the first symbol is blank then accept. If it is b then reject. If it is a then erase this a (i.e., replace it with a blank), move the head right, and go on to the next step. 2. Repeatedly move the head right until the blank symbol is found. After it is found move the head one cell to the left (to the last symbol of the string) and go on to the next step. 3. If this last symbol is not b then reject. Otherwise, erase this b, move the head one cell left, and go on to the next step. 4. If this last symbol is not (another) b then reject. Otherwise, erase this b, move the head one cell left, and go on to the next step. 5. Repeatedly move the head left until the blank symbol is found. After it is found move the head one cell to the right (to the first non-blank symbol of the string) and go back to step 1. (b) Give the sequences of configurations that your TM enters when given as input strings (i) aabbbb, and (ii) aabb. (c) What language is decided by the TM from part (a)