DFA Construction

Consider the language L over the alphabet $\{0,1\}$ defined as follows: L contains all strings that start with $\text{'}1\text{'}$ and end with $\text{'}0\text{'}.$ Construct a DFA $($Deterministic Finite Automaton$)$ that recognizes this language.