A, B, C, E are TRUE. C choice.
For D consider the regular language $\{0, 00\}$. We cannot make a DFA with a single final state. But for any NFA, we can reduce it to an equivalent NFA with a single final state- just make a new final state, mark all final states as non-final and add an epsilon-transition from those final states to the new one.