P$2[60$ points$]$ Determine whether the following languages are decidable or undecidable and prove

your claim. Do NOT use Rice's Theorem.$)(w^R$ means the reverse of w$.$ So if $w=001,w^R=100)$

a$)$ Let $MI{R}_{\text{D}\text{F}\text{A}}=\{\begin{array}{c}(\text{:}M\text{:})|M\end{array}$ is a DFA that accepts $w^R$ whenever it accepts $\{$:$w\}.$