All strings ending with $10$. So, we need $3$ states.
- From first state on $1$, we go to second state.
- From second state on $0$ we go to third state.
- From third state on $0$ we go to first state and on $1$ we go to second state.
Only third state is final.
L = (0+1)*10
Minimal DFA will be as follows: