Contruct an NFA of the language accepted by the grammar below.
$$G=(\{S,A,B\}, \{a,b,c\},S,P)$$
$P: S\rightarrow abaS\ \ | \ cA\\ \ \ \ \ \ \ A\rightarrow bA\ \ | \ cB \ \ | \ aa\\ \ \ \ \ \ \ B\rightarrow bB \ \ | \ cA \ \ | \ bb$
No need to draw the NFA. My confusion is how to draw $S \rightarrow$ $abaS$. Is it just drawn out like $\rightarrow (q_0) \rightarrow a \rightarrow (q_1) \rightarrow b \rightarrow (q_2) \rightarrow a \rightarrow (q_3)$? I don't think that it is but I can't figure out how else to do it.
Also, when it says $A\rightarrow bA\ \ | \ cB \ \ | \ aa$, $\ $does the $aa$ represent a final state? If it does than does this NFA have two final states?