Problem $2.$ Consider the grammar

$SBA$

$Aba|AA|a$

$B$SAb$|b|$

Show that this grammar is ambiguous by constructing two different leftmost derivations for the

sentence baaaba

Show that this grammar is ambiguous by constructing two different parse trees for the string

baaaba