3. (8 points) Let L and L2 be two languages over the same alphabet E. Define: SHUFFLE (L1, L2) = {w e 3* | W = ajb .. axbk for some k > 0, aj, b * a1a2...ak E L1, and bib2 ... bk E L2}. Note that each ai and bi can be an empty string, or of arbitrary length. In other words, SHUFFLE(A,B) is created by interleaving of two strings: one from language A and another from language B. For example, suppose L1 = {1}* and L2 = {0}*, then the strings in SHUFFLE(L1, L2) can be any string in {0,1}* Show that if L1 and L2 are regular languages, SHUFFLE(L1, L2) is also regular. Note that your proof needs to work for any regular languages A and B, not just the example with L1 and L2 given above