3. (15 points) Consider the following two DFAs N and N2 over the alphabet {a,b,c}, given in tabular form: [redacted] 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 (redacted] states (labeled appropriately A1, A2, etc.) and all transitions. [explanation of the two automata's behaviors redacted] 3. (15 points) Consider the following two DFAs N and N2 over the alphabet {a,b,c}, given in tabular form: [redacted] 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 (redacted] states (labeled appropriately A1, A2, etc.) and all transitions. [explanation of the two automata's behaviors redacted]