(15 points) Consider the following two DFAs N1 and N2 over the alphabet {a,b,c}, given in tabular form: N1 = a b AB A A | +C | C C C N2 a b c +*11 1 2 *2 3 1 2 3 3 3 3 Using the product construction described in class and elsewhere, construct the product DFA N1 N2 that recognizes the language L(N1) n L(N2). Give your answer either in tabular form or as a transition diagram. Do not perform any simplifications/optimizations such as removing unreachable states or merging indistinguishable states. Include all 9 states (labeled appropriately A1, A2, etc.) and all transitions. [N1 accepts those strings in which a b occurs somewhere to the right of an occurrence of a; N2 accepts those strings that do not have ca as a substring.)