4. (7 pts) Suppose that the input alphabet for two- finite state machines M1 and M2 is {={a,b,c}, that the initial state for Mi is q. and the initial state for M2 is q., that the accept states for M1 are q., 91, and qz, that the accept state for M2 is qa, and that the transition functions for the two machines are defined as follows: M1: M2: a QO 02 Q3 Q2 Q2 Q2 b Q2 Q2 Q2 Q1 a Q6 Q5 Q4 Q1 Q2 Q3 b Q4 Q5 Q5 Q4 Q5 Q6 Q4 Q5 Q5 QO Q2 Q2 Use the product construction to give the transition table for a deterministic FSM M3 that accepts the intersection of the sets accepted by Ml 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