3. (2 points) Prove that regular languages are closed under reversals. A reversal of a string w a, .a, which is denoted wR, is w a...a,a, In plain English, it's the string backward. Thus for any language L, its reversal is the set of all reversals from L, or more formally, LR (w I w in L)