In order to complete this class activity, you need to install JFLAP on your computer: - Give a DFA that accepts the language over ={a} of an even number of a's (0.25pt) - Give a DFA that accepts the language over ={a,b} of strings with an even number of a's and an odd number of b 's. >(0.25pt) - Give a DFA that accepts the language over ={a,b} of strings with any even number of a's and at least three b's. >(0.25pt) - Give a DFA that accepts the language over ={a,b} where the number of a 's and b 's are either both even or both odd. >(0.25pt) - Construct a DFA over ={a,b} that accepts the following language: L={w |each a is followed by exactly 3b 's } >(0.25pt) - Let ={0,1} and let L={ww is a nonempty string whose characters alternate between 0 's and 1's. Design a DFA for L Sinsert a screenshot here> (0.25pt) - Construct deterministic finite automata recognizing the following languages over the alphabet. {0,1} : (a) {04ji0,j0,i^+j is an even number } cinsert a screenshot here (0.25pt) (b) The set of all strings that begin with 1 but do not contain 110 as a substring. >(0.25pt)