Consider the following finite automata P and Q over the alphabet {a, b, c}.…

Consider the following finite automata P and Q over the alphabet {a, b, c}. The start states are indicated by a double arrow and final states are indicated by a double circle. Let the languages recognized by them be denoted by L(P) and L(Q) respectively.






The automation which recognizes the language L(P) ∩ L(Q) is :