Let us see what we get by following the production rules :
$S \rightarrow \underline{A}a \rightarrow \underline{B}a.a \rightarrow abcaa$
We see that the language consists of just one string, which is $abcaa$. Thus, the language is finite and can be represented by FA. Hence, the highest type number is type-3.