(Solved): Consider the Turing Machine (TM) T (over the input alphabet ={a,b} ) given below. Hint: Trace th ...

Consider the Turing Machine (TM) $$T$$ (over the input alphabet $$?=\{a,b\}$$ ) given below. Hint: Trace the execution of the TM on a few strings of as and bs so that you can see how it works. (a) What is the shortest word that would be accepted by $$T$$ ? (b) What is $$\mathrm{accept}(T)$$ ? (c) What is reject $$(T)$$ ? (d) What is $$\mathrm{loop}(T)$$ ? (e) What is left on the tape if $$T$$ halts? (2)