L1 contains each string in the regular language L with the characters reversed. If the original language L is regular, then the new language L1 obtained by reversing each string must also be regular.Read less