Matching logic expressions with their truth tables.   Question 1 options:   a  b  x 0  0  0 0  1  1 1  0  1 1  1  0   a  b  x 0  0  1 0  1  1 1  0  1 1  1  0   1. x = a XOR b 2. x = a NAND b 3. x = a NOR b   Order the precedence from high to low for following Boolean operators.   Question 10 options:   OR   AND   complement   Please map commutative, associative, and distributive laws of Boolean algebra theorems with corresponding equations.   Question 7 options:   (x + y) + z = x + (y + z) (xy)z = x(yz)    x+y = y + x xy = yx     x + (y · z) = (x + y) · (x + z) x · (y + z) = (x · y) + (x · z)   1. Commutative Law 2. Associative Law 3. Distributive Law

Assume the following rules of associativity and precedence for expressions: Precedence Highest *, /, not +, -, &, mod - (unary) =, /=, =, > and Lowest or, xor Left to right Associativity Show the order of evaluation of the following expressions by parenthe- sizing all subexpressions and placing a superscript on the right parenthe- sis to indicate order. For example, for the expression а +b* с + d the order of evaluation would be represented as ( (a + (b * c)')² + d)³ а. а * b 1 + C b. a (b - 1) / c mod d с. (а b) / с & (а * е / а - 3) d. -a or c = d and e е. а > b хоr c or d <3 17 f. -a + b

Give a brief explanation of the idea of operator precedence.

Explain the syntax of manipulator left.