Q$2.$ is a Deterministic Finite Automaton $($DFA$)$ and it has at least one

useless state That means there is at least one state such that for any input string this state

cannot be reached.$)$

Prove that $U_{\text{D}\text{F}\text{A}}$ is a decidable language.