Prove that the DFA constructed by MAKEDETERMINISTIC in Section 3.7.2 is equivalent to the original NFA. To do so, you must show that an input string can lead to a final state in the NFA if, and only if, that same string will lead to a final state in the corresponding DFA.