Can an NFA have multiple accepting states?
Whenever one is in doubt about central notions, one must consult the definitions of them. You should do this yourself (I assume that you have a textbook at your disposal).

Below is Definition 1.37 from Introduction to the Theory of Computation by Michael Sipser:

A nondeterministic finite automaton is a 5-tuple $(Q,\Sigma,\Delta,q_0,F)$, where


$Q$ is a finite set of states,
$\Sigma$ is a finite alphabet,
$\delta: Q \times \Sigma_{\epsilon} \rightarrow \mathcal{P}(Q)$ is
the transition function,
$q_0 \in Q$ is the start state, and
$F \subseteq Q$ is the set of accept states.


Item 5 tells us that $F$ is just a set of states, which means that it can be the empty set, a singleton set or a set with several states as elements.