Consider the language REGULAR TM $=\{|$ M is a Turing machine and L$($M$)$ is

regular $\}$ and the complementary language NONREGULARTM $=\{|$ M is a Turing

machine and L$($M$)$ is not regular $\}.$ Both of these languages are undecidable; in fact, both

are not even recognizable. The

proof can be used to show that one of the above two languages is not recognizable.

Examine closely the proof in the book and determine which of the two languages,

REGULAR TM or NONREGULAR TM$,$ can be shown to be not recognizable using the

construction in this proof. Justify your answer