For the grammar

S a | b | c | aSa | bSb | cSc

find derivation trees for the following:

(a) aaa

(b) abbcbba.

A language, L, over the symbols a, b, and c, is defined by the following grammar rules, where S is the start symbol.

S aS

S aB

B bc

Find a definition of the set L.