Write NFA for the following languages. Include at least three good and three bad strings. Draw the NFA diagram, and give formal definitions for your NFA. Evaluate whether each edge you have needs to be in the diagram. Do not show any trap states.

The language of all strings that

end in b or c

do not have a or b as the second character from the end

start with bb

do not contain c and do not contain b