Prove that NFAs are exponentially more succinct than DFAs: for any m, there exists an NFA with m states such that any equivalent DFA has at least 2^(m - 1) states.