Problem 3. [20 points] A nonerasing Turing machine is one that cannot change a non-blank symbol to a blank. This can be achieved by the restriction that if then a must be # Show that no generality is lost by making such a restriction. That is, any language that was Turing acceptable before is Turing acceptable now, and any language that was Turing decideable