Assume the following rules of associativity and precedence for expressions: Precedence Highest *, /, not +, -, &, mod - (unary) =, /=, =, > and Lowest or, xor Associativity Left to right Show the order of evaluation of the following expressions by paremhesizing all subexpressions and placing a superscript on the right parenthesis to indicate order. For example, for the expression a + b * c + d the order of evaluation would be represented as ((a + (b * c)^1)^2 + d)^3 a * b - l + c a * (b - 1)/c mod d (a - b)/c & (d * e/a - 3) -a or c = d and e a > b xor c or d