Find minimum number of states that are required in DFA (L).”

Found this question in Made Easy Test Series and I think the question is incorrect, as the language is not regular. The solution of this question given by Made Easy is “L is a language, which contains all the strings containing substring 011.”

But for the given solution to be true L should be, L = {w011x | w,x ∈ (o+1)*}.