Let T $=\{|$ M is a TM that accepts wR whenever it accepts w$\}.$ Show that T is undecidable.

wR: w written backwards $($e$.$g$.$ if w $=010111$ then wR $=111010)$

Construct a TM for it by using decider. And show all the steps of the construction of TM one by one.