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.