Questions 1. Design a DFA over the alphabet S = {0,1} that will recognize the language L(A) = {w\w has both an even number of O's and and even number of 1's } 2. (Course text exercise 2.2.4) For each case below, design a DFA A over the alphabet = 0,1} that will recognize the language L(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. (Course text exercise 2.2.5c) Design a DFA A over the alphabet {0,1} that will recognize the language L(A) = {w/w either begins or ends (or both) with 01} 4. Design a DFA that will recognize the pattern string P = ababaca over the alphabet = {a,b,c}. In other words, specify a deterministic finite automaton A = {0, 1,8,90, F} that will recognize the language L(A) = {w w contains the substring ababaca}