(18 marks) For each of the following languages, draw the state diagram of a deterministic finite automaton that accepts the language. (Note: This means that your finite automaton should accept every string in the language and should not accept any strings that are not in the language.) (Note: We will discuss in class on January 27 that the term deterministic just means that there is exactly one transition defined for each input symbol in each state.) (a) L1={00,0011,110} (You can assume here that the input alphabet is {0,1}. Your FA should accept the three strings in L1 and should not accept any other strings of zeroes and ones.) (b) L2={w{0,1,2} the sum of the digits in w is greater than or equal to 3} (For example, the string 2102 is in L2 because the sum of the digits in the string is 2+1+0+2=5, which is greater than or equal to 3 .) (c) L3={w{0,1}w has a length of at least 7 , and the second and sixth symbols are different from each other\}