Suppose that L is an arbitrary regular language. Prove that LR$,$ the reverse of L$,$ is also regular.If a string w is in L$,$ the reverse of that string, wR$,$ is in LR$.$ The reverse operation is defined recursively as: R $=$ For a string w and symbol a $,($wa$)$R $=$ a$($wR$)$i$.$e$.(110)$R $=011.$