Consider the problem of determining whether a single-tape TM ever writes a blank symbol (i.e., ?) over a non-blank symbol during the course of its computation on any input string. Formulate this problem as a language and show that it is undecidable.