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$;$"$

$->$

$->|$

$->=$ ;

$->$ identifier

$->$ number $|$ identifier $|+|*$