For any string w-w1w2 . . . wn, the reverse of u, written WR, s the string u, n reverse order, tvn . . . tv2wi . For any language A, let AR = {WRI w E A). Show that if A is regular, so is AR