Consider the language over ∑={0,1} such that every string in language contains…

 Consider the language over ∑={0,1} such that every string in language contains odd occurrence of substring “01”. The number of states in min DFA which accept the given language are ______