Question 6. (20 points) Consider the following DFAs over = {a,b}. M1 M2 a b b a B Y 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(M3) = L(MI) L(M2). Part a. Write the transition tables for M1, M2 and M3. Use an exclamation mark (!) to designate the accepting states in M1 and M2. For example, designate the non-accepting state A as A but the accepting state B as B!. Part b. Draw the transition diagram of M3. If there are unreachable states, you don't need to include them in the diagram