Consider the following languages: H A L T $=\{<$ M $,$ w $>|$ Turing Machine M stops $($either accept or reject$)$ on input w $|\}$ and Show that S t o p s $$ is undecidable by using a reduction from HALT