PLEASE ANSWER THIS ON PAPER I DONT WANT A MACHINE LEARNING AWNSER I WANT SOMEONE TO AWNSER IT IF NOT THIS WILL BE MY LAST MONTH ON CHEGG

Let REV$\_($TM$)=\{|$ M is a TM that for all words w$,$ M accepts both w and w$^($R$)$ or it rejects both w and w$^($R$)\}$

Reminder: w$^($R$)$ is the reverse of the string w$.$ E$.$g$.1101^($R$)=1011$

Show that REV$\_($TM$)$ is undecidable: