1) On ={a,b} input alphabet, design a deterministic finite automata (DFA) that will accept a language with no more than three 'a' in it. 2) On ={a,b} input alphabet, design a deterministic finite automata (DFA) that will accept a language with a string length of zero or a multiple of three (|s| mod3=0). 3) On ={1,0} input alphabet, design a deterministic finite automata (DFA) that will accept an even number of ' 0 ' and/or an even number of 1%. Ex: 00, 11, 0011,0101, 0110,0000,1111