Say that a write-once Turing machine is a single-tape TM that can alter each tape square at most once (including the input portion of the tape). Show that this variant Turing machine model is equivalent to the ordinary Turing machine model. As a first step, consider the case whereby the Turing machine may alter each tape square at most twice. Use lots of tape.