For any string w $=\backslash$sigma $1\backslash$sigma $2\backslash$sigma n its reverse is given by w

R $=\backslash$sigma n $\backslash$sigma $2\backslash$sigma $1.$ For a language

A$,$ let AR $=\{$w

R$|$w in A$\}.$ Show that if A is regular, so is AR