For any string w = w1w2...wn, the reverse of w, written wR , is the string w in reverse order,...

For any string w = w1w2...wn, the reverse of w, written wR , is the string w in reverse order, wn...w2w1. For any language A, let AR = {wR/wEA}. Show that if A is regular, so is AR.