(3) For any string www.Wn, the reverse of w written w is the string in reverse order u'nun-1 wi. For any language AR-(wR | w A} b) If A is regular and B is regular, prove that the following languages are regular. i) {wRyR | tve A, ye B} s regular ii) (u, abia2b2 . . .anbn | aia2 an A and bibz bn B). Hint: create a state for pairs of states of the form (A,B) for ga, a states in the DFA's for A and B respectively