Prove that regular languages are closed operations defned below: i(A) = {x^R | x A} C(A1,A2) = {w | wx A1 and x A2}