Two NFAs or DFAs are called equivalent iff they accept the same language. Prove that any NFA is equivalent to another NFA that has exactly one final state non-initial state