Given the following CFG/BNF, create parse tree(s) for the assignment statement A = B + C * A

Is the grammar ambiguous? Support your answer with details (work).

< assign > --> < id > = < expr > < id > --> A | B | C < expr > --> < expr > + < expr > | < expr > * < expr > | ( < expr > ) | < id >