Consider the following CFG:

$SaB|bA|D|E$

$Aa|aS|bAA|c$

$Bb|bS|aBB|c$

$DdD|Dd|d$

$EEE|EdE$

i$)$ Give the left most derivation of the String aabbcc

j$)$ Give the parse tree corresponding to the derivation in i$)$

k$)$ Is this language ambiguous or not ambiguous? Explain