I am trying to learn how to construct an NFA state diagram.
$$M = \{q0, q1, q2\}, \{a,b\}, \delta, q0 , \{q2\}$$
$δ(q0,a) = q0; \delta(q0,b) = {q0,q1}; \delta(q1,a)= {q0, q2}; \delta(q1,b) = {q1}; \delta(q2,b) = {q1}$
From the above notation, I drew the state diagram below. Is this diagram correct?
In state $q1$ I don't understand how $a$ can transition to state $q0$ OR to state $q2$. How can the string $ba$ be accepted but also not accepted, depending on which path the NFA takes? Can you help me understand.