That is, show that there is a deterministic Turing machine that decides this language in polynomial time in the size of the input:
Since the input to this problem is a DFA, state explicitly in your solutions what the size of the input is (i.e., how it is measured).