5. Given the grammar S --> aS | SB | d B --> Bb | c Show that this grammar is ambiguous by exhibiting two different parse trees for the derivation of the string aadccb.