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.

Consider the NFA M shown in Fig.

a)State two reasons why this is not a DFA.

b)Is the string 1 1 0 1 1 0 accepted by this NFA? A simple yes or no answer will do

c)If your answer to [b] is yes, then show two successful execution sequences for the input 1 1 0 1 1 0. If your answer to [b] is no, show two unsuccessful execution sequences for the input 1 1 0 1 1 0

d)Show the transition table of this NFA.

Figure 2: NFA M Figure 3: NFA M