Automata Theory/ Formal Languages. Thank you.

1. Consider a Language L containing a set of strings. We define LR as LR={wR:wL}, where wR is the reverse of string w. For example, if L={abb, bab, abbb}, then LR={bba,bab,bbba}. Note that L can either be finite or infinite. Prove that (L1UL2)R=L1RUL2R. 4 points 2. Are the following two grammars G1 and G2 equivalent 4 points G1:S->aSb|ab|.G2:S->aAb|abAaAb 3. What is the language generated by the following grammars on ={a,b}. You can either formally state the language using set theory notations, or you can concisely describe the language in plain English