I am aware that it is possible to show the ambiguity by either parse tree or by looking at the syntax grammar but in this question, I am not sure how I can draw 2 different parse trees.Inorder to show ambiguity using parse tree is it necessary to always go with left-hand derivation and right-hand derivation? or it depends on how expression is evaluated even if we choose left hand derivation .Kindly explain the answer to 1.1 and 1.2 in steps.

r Consider the following grammar sid-ABIC 1.1.( 10) By using the expression -C"A + B C demonstrate that the grammar is ambiguous accorsding to the usual precedence rules of the arithmetic operators. the arithmetic operators. 1.2 (1) Rewrite the grammar to make it unambiguous uccording to the usual precedence rules of