This question asks you to examine the formal definitions of a TM and related concepts closely. Based on these definitions, answer the following.
(a) A configuration of a Turing Machine (TM) consists of three things. What are these three things?
(b) Can a Turing machine ever write the blank symbol Union on its tape?
(c) Can the tape alphabet Gamma be the same as the input alphabet Sigma?
(d) Can a Turing machine's head ever be in the same location in two successive steps?
(e) Can a TM contain just a single state?
(f) What is the difference between a decidable language and a Turing-recognizable language?