Create NFA for the union (regular operation) of the following languages; use the construction given in class. For each, give at least four good strings (they should not all be from one language). Draw the diagrams, but do not give formal definitions. Do not reduce (remove states, etc.) the constructed NFA in any way. The underlying FA can be DFA or NFA. sigma = {a, b, c}

The language of all strings that

[end with cc] U [start with a]

[start with c] U [even number of as]

[less than 3 characters long] U [start and end with the same character]