Deterministic finite automaton

The figure illustrates a deterministic finite automaton using a state diagram. In the automaton, there are three states: S, S, and S (denoted graphically by circles). The automaton takes a finite sequence of 0s and 1s as input. For each state, there is a transition arrow leading out to a next state for both 0 and 1. Upon reading a symbol, a DFA jumps deterministically from one state to another by following the transition arrow. For example, if the automaton is currently in state S and the current input symbol is 1, then it deterministically jumps to state S. A DFA has a start state (denoted graphically by an arrow coming in from nowhere) where computations begin, and a set of accept states (denoted graphically by a double circle) which help define when a computation is successful.

Question: can a dfa have more than one final state
Answer: yes