Suppose that we have two words wie & and w2 Let wi $w2 represent the word w over the alphabet IjU22 that alternates the letters of w and the letters of w2. Thus, the first letter of w1 $w2 is the first letter of wi, the second letter of w1 $ w2 is the first letter of w2, the third letter of wi $w2 is the second letter of w1, the fourth letter of w1 $w2 is the second letter of w2, and so on. For example, automata $ theory = atuhteoomrayta. For two languages Li CE and L2 C 2, let Li L2 {w1 $w2|w1 E L Aw2 L2}. Given a DFA M1 = (Q1,21,81,91,F1) that recognizes L and a DFA M2 = (Q2, E2,82,92, F2) that recognizes L2, construct a finite automaton M that recognizes Li #L2. Suppose that we have two words wie & and w2 Let wi $w2 represent the word w over the alphabet IjU22 that alternates the letters of w and the letters of w2. Thus, the first letter of w1 $w2 is the first letter of wi, the second letter of w1 $ w2 is the first letter of w2, the third letter of wi $w2 is the second letter of w1, the fourth letter of w1 $w2 is the second letter of w2, and so on. For example, automata $ theory = atuhteoomrayta. For two languages Li CE and L2 C 2, let Li L2 {w1 $w2|w1 E L Aw2 L2}. Given a DFA M1 = (Q1,21,81,91,F1) that recognizes L and a DFA M2 = (Q2, E2,82,92, F2) that recognizes L2, construct a finite automaton M that recognizes Li #L2