14. Letr be a regular expression, and let L(r) be the language generated by r. Define LR(r) = { wWRE L(r)} to be the reversal of L(r), i.e. LR(r) contains the reverse of strings in L. Give a regular expression to generate LR(r). Hint. You will need to proceed inductively using strong induction. The base cases will be for regular expressions defined by the first three rules for creating regular expressions, and the inductive cases will be for regular expressions defined by the remaining three rules. 14. Letr be a regular expression, and let L(r) be the language generated by r. Define LR(r) = { wWRE L(r)} to be the reversal of L(r), i.e. LR(r) contains the reverse of strings in L. Give a regular expression to generate LR(r). Hint. You will need to proceed inductively using strong induction. The base cases will be for regular expressions defined by the first three rules for creating regular expressions, and the inductive cases will be for regular expressions defined by the remaining three rules