1. Design a DFA over the alphabet E= {0, 1} that will recognize the language L(A) = {ww has both an even number of 0's and and even number of 1's } 2. For cach casc below, design a DFA A over the alphabet E = {0,1} that will recognize the language L(A): (a) L(A) = {w/w ends in 00} (b) L(A) = {w|w contains the substring 000} (c) L(A) = {w\w contains the substring 011} 3. Design a DFA A over the alphabet E = {0, 1} that will recognize the language L(A) = {w|w cither begins or ends (or both) with 01} ababaca over the alphabet E = 4. Design a DFA that will recognize the pattern string P = {a, b, c}. In other words, specify a deterministic finite automaton A = {Q,E, 6, qo, F} that will recognize the language L(A) = {w/w contains the substring ababaca}