Prove that for any regular languages A and B, L1 = {*Ry* A, Y E B} is regular, where xR is the reversal of x. Prove also that L2 = {xPyx | x A, Y E B} is not regular