For any string  w= w1w2w3..wn, the reverse of w, written w^R, is the string w in reverse order,  wn...w2w1. For any language A, let [tex]A^R = \{w^R|w \in A \}[tex]. Show that if A is regular, so is A^R