For any string $w=w_1{w}_{2}cdots{w}_n,$ the reverse of $w,$ written $w^R,$ is the string $w$ in reverse order;

that is$,w^R=w_{n}cdots{w}_2{w}_1.$ For any language $A,$ let $A^R=\{w^R|winA\}.$ Show that if $A$ is

regular, so is $A^R.$