Given the following context$-$free grammar $($start variable is S$),$ draw the parse tree of string "abaabb". $($if you wish to upload an image, please do so by inserting an image in the text$-$box given to you by Canvas Discussion environment$).$

$S$aSb$|bSa|SS|ab|ba$

Describe an interesting property of strings generated by the CFG mentioned in part $1.$

Assuming that $12$ and $43$ are two number tokens and sum is a valid identifier, draw the parse tree for the following statement given the following BNF grammar: "sum $=43*$ sum $+12$ ;$"$