Problem 2 (6o point total) Let D1,D2 be two deterministic finite automata where - D1=({q1,q2,q3},,1,q1,{q2}) - D2=({r1,r2,r3},,2,r1,{r1,r3}) a. (1o point) Draw state diagrams for D1 and D2 with all the standard features (i.e. state name, transition labels for each edge, starting state, accepting state(s) stc.) clearly indicated in the diagrams. 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)L(D2). c. (3o point) For any sets A and B, let AB denotes the set AB={xx 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)andL(S2)=L(D2)L(D1)