I need fast help in these questions. I have only 30 minutes . Please do it correctly and 100%

Problem 2 Construct a DFA that recognizes the following language with the alphabet being {0,1}. NOTE: You must provide the formal definition of the DFA, as well as its state transition diagram. L={w{0,1}011 is a substring of w and 100 is not a substring of w}