Givenand <A> is some encoding of machine ACode:M = {<A> | A is DFA and L(A) = empty set }

Is M decidable?

Can someone work with me on how to solve these kinds of problems. This is example problem. We can walk trought similar problems. All online examples seems to be too abstract.

help would be much appreciated

thank you