How to think when devising a TM that decides if a DFA rejects some string?
The problem with your approach is that there are infinitely many strings in&nbsp;$\Sigma^*$. If the automaton keeps accepting and accepting, how would you know hen to stop?

Instead, consider how an automaton can reject: it rejects by getting to a rejecting state.