Design a nondeterministic finite automaton whose language is:

for the alphabet = {a, b, c}.

= {we Lw has length at least three and the third-to-last and second-to-last symbols in w are different}