$\{|$ D is a DFA and L$($D$)$ intersect L$($A$)$ is empty$\}$ where A is a DFA with language L$($A$)=\{$all binary numbers divisible by $3\}$ is it decidable, undecidable, turing recognizable or turing unrecognizable