Q1. For each of the following languages, draw the state diagram of a deterministic finite automaton that accepts the language. a. L1 = {w E {0, 1, 2} * | the sum of the digits in w is greater than or equal to 3} b. L2 = {w {0, 1} * w contains exactly two ones or exactly one zero.} Q2. For this question the finite automata below, identify the language accepted by the FA. Try to describe the language in the simplest terms possible. 1.2 1.2 1.2 -9-9-8-8-8-8 0.1 0,2 0,1,2