Prove that each Turing machine can be converted to a (potentially different) Turing machine that recognizes the same language but never rejects. In other words, on each input string, this new machine will either accept or loop. Your proof should give and justify the formal definition of new Turing machine based on parameters describing the old machine. Explain why there's no such conversion procedure that'd always produce a Turing machine that, on each input string, will either accept or reject (but never loop)