please help with a detailed broken down solution, im having difficulty understanding this

Given the following BNF: ! = ! A | B | C ! + | ! * | ! () | (1) Rewrite the above BNF to give + precedence over * and force + to be right associative. (2) Using the given BNF, draw a parse tree and a leftmost derivation for each of the following statements: A = A * (B + C) A = B * (C * (A + B))