e$.$ Construct a nondeterministic finite$-$state automaton that recognizes the set of strings of length at least two over the alphabet $\{a,b,c\}$ such that the final character has appeared before. For example, abca, bcacbaa, acabc, ccbb are accepted and abc, cbca, abbac are rejected.