The conditions for B1, B2, and B3 are

(a) B1 = {w | w has an even number of 0 s, or, contains exactly two 1 s}.

(b) B2 = {w | every odd position of w is 1}. (c) B3 = {w | all strings except the empty string and the string 11}.

You can ignore D here :)

2. (20 point) By using the NFAs you have constructed in the first question, apply the standard methods as desribed in in Sipser (Figure 1.46, 1.48 and 1.50) to design NFA Na and a NFA N, such that Your answer should provide, for each DFA, a finite state diagram where all the states, the starting state, all of the accepting states and all the transitions (with the corresponding labels) are dis played/drawn clearly. Show intermediate steps