1. Give the state diagram of a DFA accepting the following language B over the alphabet {0,1}, and briefly explain how it works. B = {W | 11 is not a substring of w}