I need a help in this question. Some one please help me

e) dd draw the FSM. (7 pts) Suppose that the input alphabet for two finite state machines M1 arn =(a,b,c), that the initial state for M1 is q and the initial state for M2 is G4 t states for M1 are qo, qu, and q2, that the accept state for M2 is q, and that functions for the two machines are defined as follows: and M2 is qa, that the accept ransition that the transition M1: M2: Q0 Q1 02 03 04 05 Q6 Q2 01 02 Use the product construction to give the transition table for a deterministic FSM M3 that accepts the intersection of the sets accepted by MI and M2, and list the accept states. Do not include in the transition table for M3 any extraneous states that cannot be reached from the initial state of M3