For any string $sin{}^{**},$ writing its individual symbols so that $s=s_1{s}_{2}dots{s}_n,$ we define its reverse $8^R$ as simply $$ written backwards:

Given $s=s_1{s}_{2}dots{s}_n$ with $sin{}^{**}$ and therefore $s_{i}in$ for $1in,s^R=s_n{s}_{n-1}dots{s}_2{s}_1.$ Similarly, for any language $L$ over $,$ we define its reverse language as the language containing the reverse of all its strings:

Given a language $L,L^R=\{s^R|sinL\}.$

Show that the reversal operation preserves the property of regularity $-$ that the class of regular languages is closed under reversal.