What is the minimum number of states in a DFA that accepts all binary strings ending in 01?

Explanation

Three states are enough: the start state, a state meaning 'the last symbol is 0', and an accepting state meaning 'the last two symbols are 01'.