Let $L$ be the language $\{\langle M \rangle : M\text{ is a DFA that accepts only odd-length strings}\}$.
Prove that $L$ is decidable.
How wrong is my answer?
Create a TM $T$ that decides $L$:
Create an equivalent input string $v$ that is in the language $L(M)$.
Give encoding to $T = \langle M, v \rangle$.
TM $T$ simulates $M$ on input $v$.
If TM $T$ halts and accepts, accept. Otherwise, reject.
I would like to know how off I am with my answer.