Prove by (structural) induction that, if R is a regular expression describing the language L, then there must exist a regular expression R to the power of r describing the langue L to the power of r consisting of the reverse of all strings in L.