Given a DFA D$,$ we consider the problem whether it accepts ALL strings where any two$$ adjacent characters are different $($such as $0,1,01,10,010,101,$ etc$),$ formulate this problem as a$$ language, denote it as LDIFF. Prove that LDIFF is decidable.