2. (30 + 20 = 50 points) Consider the following two DFAs with alphabet = {a,b}. M1 accepts the strings that do not contain 'aa'. M2 accepts the strings that end with 'ab'. (a) 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(M1) n L(M2). (b) Test all three machines with the four strings aa, ab, aba, aab and state whether they are accepted or not. Explain if the results are correct. 8-0-88-85-19 b