1 . A string that is obtained by rearranging the letters of the word
\[
\mathrm{ARABICA}
\]
is stupendous if it contains the substring $\mathrm{CAB}$. For example $\mathrm{ARA\underline{CAB}I}$ and $\mathrm{I\underline{CAB}AAR}$ are both stupendous, but $\mathrm{ARABICA}$ is not. How many stupendous strings are there?
(a)
$40$
(b)
$60$
(c)
$30$
(d)
$50$
(e)
$70$