a) Draw (or otherwise make) the state diagram for an NFA N over alphabet {b, c} with states q0, q1, q2 and q3 such that q0 is the start state, q3 is the accepting state, and maps q0 to {q1, q2} on b, q1 to {q3} on b and q2 to {q3} on c. Any other state, symbol pair is mapped to the empty set.

b) What is the language L recognized by N? Justify your answer.

c) Draw the equivalent DFA to recognize L. Use the construction from Sipser (and lecture). That means your states will be labeled by sets of states from the NFA.