Consider the following grammar over $\backslash$Sigma $=\{$a$,$ b$,$ c$,$ d$\}$:

S $->$ Sa $|$ dT

T $->$ bTb $|$ c

How many of the following strings are not in L$($G$)?$