For any string w of length l $($w $=$ w$1$w$2...$wl$,$ where wi in $\backslash$Sigma $),$ we define following two operations.

$($a$)$ reversal: wR $=$ wlwl$1...$w$1($Example: w $=$ evian, wR $=$ naive$).$ Show that if a langauge L is

regular, reversal of the language, LR is also regular.

page $1$ of $2$