3. For any string w = w1w2 wn, the reverse of w written wR is the string in reverse order, wnu'n-1 wi. For any language A, let AR = {wR I w (a) (3 points) Show that if A is regular, so is AR. (b) (3 points) Show that if A is regular, so is B(A) = {wRy | w, y A} (c) (5 points) Prove that the following is false: if A is regular, so is C(A) uw w A), by choosing a specific regular language and proving C(A) is not regular