Prove, using a reduction argument such as given in Section 17.3.2, that the problem of determining if an arbitrary program will print any output is unsolvable.

17.3.2 The Halting Problem Is Unsolvable While there might be intellectual appeal to knowing that there exists some function that cannot be computed by a computer program, does this mean that there is any such useful function? After all, does it really matter if no program can compute a "nonsense" function such as shown in Bin 4 of Figure 17.5? Now we will prove