To complete the proof that DFA and NFA machines are equivalent (proving that NFAs and DFAs are equally powerful), prove that the resulting DFA accepts exactly the same language as the original NFA. Hint: all DFAs are already in NFAs(no conversion needed), use proof by contradiction and induction on the length of the word.