Show, using a reduction from AT M $,$ that the following problem$/$language is undecidable:

Given $($encodings of$)$ two Turing Machines M$1$ and M$2,$ does there exist an input w

that neither M$1$ nor M$2$ accept? That is$,$ prove that the following language is not

decidable, by means of a reduction from AT M :

EXCL$2$T M $=\{$M$1,$M$2|$ there exists an input w that both M$1$ and M$2$ reject$\}$