Consider the following grammar given below.
$$
\begin{aligned}
& A \rightarrow B+A \\
& A \rightarrow B \\
& B \rightarrow C B \\
& B \rightarrow C \\
& C \rightarrow D^* \\
& C \rightarrow D \\
& D \rightarrow(A) \\
& D \rightarrow a \mid b
\end{aligned}
$$
What will be the content of the stack of SLR parser immediately after shifting the last character of the string: $a^* b($
- $\operatorname{CC}($
- $\mathrm{BC}($
- $\mathrm{CB}$
- $\mathrm{BB}$
