Consider the following CFG $G$ over $\Sigma = \{\mathbf{a},\mathbf{b},\mathbf{c},\mathbf{d}\}$:
\[
\begin{array}{rcl}
S & \rightarrow & S\mathbf{a} \;\mid\; \mathbf{d}T \\
T & \rightarrow & \mathbf{b}T\mathbf{b} \;\mid\; \mathbf{c}
\end{array}
\]
How many of the following strings are in $\mathcal{L}(G)$?
(A) 1
(B) 2
(C) 3
(D) 4