Design a DFA with ∑ = {0, 1} accepts those string which starts with 1 and ends with 0.

The DFA will have a start state q0 from which only the edge with input 1 will go to the next state.

In state q1, if we read 1, we will be in state q1, but if we read 0 at state q1, we will reach to state q2 which is the final state. In state q2, if we read either 0 or 1, we will go to the q2 state or q1 state respectively. Note that if the input ends with 0, it will be in the final state.