$(3+3$ points$)$ Let $=\{0,1\},$ and are regular expressions, and $.$

$($a$)$ Given the following language $E_{\text{D}\text{P}\text{A}}$ is decidable, show that $N{E}_{\text{R}\text{E}\text{x}}$ is decidable.

is a DFA and $($:$L(A)=\frac{O}{\text{:}}$

I need answer for this entire question write in a paper and show me