EXAM4 Questions 1.3 The formal description of a DFA M is ((qi, q2.gaq4As), {u, d),8, q3,(Q3)), where is given by the following table. Give the state diagram of this machine. 41 1 2 42 1 3 3 42 4 1.4 Each of the following languages is the intersection of two simpler languages. In each part, construct DFAs for the simpler languages, then combine them using the Union U construction to give the state diagram of a DFA for the language given. In all parts, -{a, b). a) (w I w has at least three a's and at least two b's) b) (w I w has an even number of a's and one or two b's) c) (w I w starts with an a and has at most one b) d) (w I w has an odd number of a's and ends with a b) e) (w I w has even length and an odd number of a's)