Regular languages and Deterministic finite automata

Problem 2 (60 point total) Let D1, D2 be two deterministic finite au- tomata where D1 = ({91,92,93}, 2, 81, 91, {92}) States 81(s,0) 81(s,1) - 91 91 9 1 92 93 91 93 93 92 D2 = ({r1,r2,r3}, 2, 82, 81, {r1,73}) States r1 r2 r3 82(s,0) r2 r1 r3 82(s,1) r1 r1 73 b. (20 point) Apply cartesian product construction to draw a state diagram (with all the standard features included) for the DFA M. such that L(M) = L(D1) U L(D2). C. (30 point) For any sets A and B, let A # B denotes the set A# B = {x|x is in the set A but not in the set B.}. By using your answer to part b, draw state diagrams (with all the standard features included) for the DFAs S1 and S2 such that L(S1) = L(D1)+L(D2) and L(S2) = L(D2) #L(D1)