We saw in class that regular languages are closed under union by designing a general algorithm that takes two DFAs A1 and A2 and constructs a new DFA that accepts the union of the languages accepted by A1 and A2. Consult section 1.1.3 in the course slides (Chapter1b.pdf). This algorithm is also described in our textbook inside the proof of theorem 1.25. Consider the following two DFAs: A1: A2 1. Follow the algorithm to construct a DFA that accepts the language L(A1)L(A2). You can submit either a state diagram or a 5-tuple (Q,,,q0,F) as defined in our formal definition of a DFA. 2. 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(A1)L(A2). Give the result of this construction