$(15$ pts$)$ Consider the following BNF grammar:

::$=$ a c $||$ b

::$=$ c $|$ c

::$=$ d $|$

For each of the strings below, indicate whether or not the string can be derived from

the grammar $("$yes$"$ or $"$no$").$ If the string can be derived from the grammar, provide a

left$-$most derivation that shows all derivation steps. Otherwise, simply indicate $$no$.$

$($a$)(5$ pts$)$ aabccd

$($b$)(5$ pts$)$ accbcc

$($c$)(5$ pts$)$ accccc