1. (15 pt) Let uw e * be two strings over the alphabet E. Prove by induction that (uw) R = RR. (Note: the reverse of a string r is denoted as IR) 2. (20 pt) Prove or disprove the following statements: (a) (@U *)n(-(09*)) = . (b) For every language L CE*, (L+)* = L*