Prove that the following BNF grammar is ambiguous.

Affiliate Marketing L

$->$

$|$

$|$

$->+|-$

$->+|-|*$

$->0|123456789$

You can draw the parse trees on a piece of paper, and then take a clear picture of your trees using your cell phone and upload the picture. Alternatively, you can just do leftmost derivations to generate the sentence instead of drawing parse trees.