Could someone please help me with this? After I draw the graph, it seemingly doesn't have a accepting state.

3. (30 points) Use the procedure described in class to construct the machine M3 that corresponds to the "product" of machines M1 and M2. In other words, L(M3L(MI)n L(M2). M1 accepts the strings that do not contain 'aa' M2 accepts the strings that end with 'ab'. Test all three machines with the four strings aa, ab, aba, aab and state whether they are accepted. M1 M2 a,b