(DFA Products): Consider the following languages: L_1 = {w elementof 0, 1, 2)*: w either starts with a 0 and ends with a 0, or starts with a 1 and ends with a 1, or is epsilon} middotL_2 = {w elementof 0, 1, 2)*: w starts with 1), and L3 = {w elementof 0, 1, 2)*: u, is the ternary representation of an integer multiple of 4} Construct DFAs for L_1, L_2, L_3. Then, using those DFAs, construct a DFA that recognizes the language L2 Intersection (L_1 Union L_3). Also, in English, describe how you constructed the final DFA