What would a finite statement machine look like that only accepts strings that start and end with 1?

Construct an FSM that accepts a binary string that must start with and end with 1.