Consider the two DFAs M1 and M2 (over the alphabet {0, 1}) shown in Fig. 1. Let L1 and L2 be the languages accepted by M1 and M2 respectively.

1. Describe in English the languages L1 and L2

2. Using the product construction derive the transition diagram of the automaton accepting the language L1 L2.

3. Using the same product, derive the transition diagram of the automaton accepting the language L1 L2.

Figure 1: M1 (left) and M2 (right)