2. Consider one-tape Turing machines that are constrained not to over- write the input string. They may write all they want on the blank portion of the tape to the right of the input string. (a) Show that these machines accept only regular sets. (If you're thinking, "Hey, why not just copy the input string out to the blank portion of the tape," think again...)