1. For each of the following languages, draw the state diagram of a deterministic finite automaton that accepts the language. (b) L2 = {w = {0, 1, 2}* | the sum of the digits in w is greater than or equal to 3} (d) La = the set of all strings in {a,b)* containing at least one occurrence of ab and at least one occurrence of ba (these occurrences may overlap, as in aaaaabaaaaaa) (f) Le = {w {0,1}* | W contains an odd number of ones and contains no more than 3 zeroes}