- build the truth table (1 point each); - derive the corresponding boolean expression, and simplify it to the extent possible (1 point each). - 3. (2 points) Given four inputs: a, b, c & d, where (a, b) represents a 2-bit unsigned binary number X; and (c,d) represents a 2-bit unsigned binary number Y (i.e. both X and Y are in the range #0 to #3) - i.e. same as q. 2 This time, there are 4 outputs - i.e. you are building 4 separate truth tables - 03, 02, 01, 00. These correspond to the unsigned 4-bit product of the two numbers X, Y E.g., if a = 1, b = 0 (i.e. X = b10 => #2); c = 1, d = 1 (i.e. Y = b11 => #3); then {03, 02, 01, 00} = {0, 1, 1, 0}, since #2 * #3 = #6 = b0110. Derive the boolean expressions only for columns o0 and 02