Draw the transition diagram (the graph) for a DFA accepting the following languages over the alphabet {0,1}. Your automata MUST be Deterministic

L = { w | w begins with the substring 1110 or the substring 0110 }