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