Prove that the following question is undecidable. Given a Turing machine M and state q of M, does M ever enter state q on some input? (This problem is analogous to the problem of identifying dead code: given a PASCAL program containing a designated block of code, will that block of code ever be erecuted)