We saw in class that regular languages are closed under union by designing a general algorith$-$

m that takes two DFAs $A_1$ and $A_2$ and constructs a new DFA that accepts the union of the

languages accepted by $A_1$ and $A_2.$ Consult section $1\mathrm{.}1\mathrm{.}3$ in the course slides $($Chapter$1$b$.$pdf$).$

This algorithm is also described in our textbook inside the proof of theorem $1\mathrm{.}25.$

Consider the following two DFAs:

$A_1$:

$A_2$:

Follow the algorithm to construct a DFA that accepts the language $L(A_1)L(A_2).$

You can submit either a state diagram or a $5-$tuple $(Q,,,s,F)$ as defined in our

formal definition of a DFA.

As seen in class and in the course slides, a slight modification of the algorithm for union

provides an algorithm to construct a DFA that accepts the language $L(A_1)L(A_2).$

Give the result of this construction.