Let $r=(a+b{)}^{*}b(c+cd{)}^{*}$ be a regular expression. How many strings of length at most $3$ are there in the language denoted by $r?$

$($a$)9$

$($b$)10$

$($c$)11$

$($d$)12$