finite automaton proof

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