3. Assume left-to-right associativity and the following rules ofprecedence for expressions: Highest *, /, mod +, – – (unary) ==,!=, <, <=, >=, > not and, xor Lowest or Show the orderof evaluation of the following expressions by parenthesizing allsubexpressions and placing a superscript on the right parenthesisto indicate order. For example, for the expression a + b * c + dThe order of evaluation would be represented as ((a + (b * c)1)2 +d)3 1) – a + b or c <= d * e xor f / g
Answer
Assuming the said precedence &associativity
The following expression
OR
OR