Exercise $1.$ Returning to unions and intersection of regular languages. We have seen how to see whether two

DFAs are language equivalent on this diagram with pairs of states. Assume that it is not the case. How can you

assign which pairs of states are accepting so that the diagram results with an automaton that $($A$)$ recognises the

intersection of the two languages, $($B$)$ recognises the union of the two languages?

$3$