how would I write a DFA called M that recognizes the language L(M₁) L(M₂).

if this is is M₁

:+ dfa M_1

Q={q1,q2,q3,q4} S={a,b} q0=q1 d(q1,a)=q2 d(q1,b)=q2 d(q2,a)=q3 d(q2,b)=q3 d(q3,a)=q4 d(q3,b)=q4 d(q4, a)=q4 d(q4,b)=q4 F={q3}

and this is M₂

:+ dfa M_2

Q={r1,r2,r3} S={a,b} q0=r1 d(r1,a)=r2 d(r1,b)=r1 d(r2,a)=r3 d(r2,b)=r1 d(r3,a)=r3 d(r3,b)=r3 F={r3}

and the explanation written out in the same form as above please!