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)$

I want my solution in such format. in the format of a machine. i dont want a description. just make the machine in the format mentioned in picture.