Give state diagram of DFA recognizing the following language.

The alphabet is ={0,1}. A ={w|w has at least three symbols and its rst and last symbols are different}