Consider the following Grammar G $=\{$v$,$ Sigma, R$,$ S$\}$ where Sigma $=\{$c$\}$:

S $->$ BB

B $->$ SS $|$ c

a$)$ What is the smallest string in L$($G$)$

b$)$ Give the parse tree of the smallest string in L$($G$)$

c$)$ Is G ambiguous $($consider the string $$ccccc$)?$ Why?