A right circular rotation takes a string and shifts every symbol one to the right. The rightmost symbol circularly wraps around to become the leftmost symbol. Let ALLrotate be the set of all unique strings generated by any number of right circular rotations. For example, rotating cat one to the right yields tca. ALLrotate(cat) ={cat, tca, atc}. Let A = { | M is a TM that accepts every string in ALLrotate(w) whenever it accepts w}. Show that A is undecidable.