8. For each of the following languages, construct a deterministic finite automaton that acceptes the language. You need to give brief and precise interpretations for the states of the machine 1 = {z E {0,1). I z contains three consecutive ls). (b) L2 r E 0,1 a does not end with 11