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 a. (10 point) Draw state diagrams for D1 and D2 with all the stan- dard features (i.e. state name, transition labels for each edge, start- ing state, accepting state(s) stc.) clearly indicated in the diagrams