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.

A) Describe in English the languages L1 and L2

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

Consider the NFA M shown in Fig 2.

a)Show the transition table of M

b)Derive an equivalent DFA using the subset construction method. Show the transition diagram of the DFA. Show only the states that are reachable from the initial state of the DFA. You may use the breadth-first-method that optimizes the subset construction but you don't have to.

Figure 1: M1 (left) and M2 (right) 3 points) Using the same product, derive the transition diagram of the automaton accepting the anguage L1L2. Figure 2: NFA M