Design a digital combinational logic circuit with four inputs: a, b, c & d, where (a, b) represents one 2-bit unsigned binary number A{1:0]; and (c, d) represents another 2-bit unsigned binary number B[1:0] (i.e. both A and B are in the range 0 to 3). The circuit has 4 outputs (or you can regard it as being 4 distinct circuits, each with a single bit output) – in other words, the truth table will have 4 input columns and 4 output columns. These output columns together repesent the 4-bit product Y[3:0] Y = A * B For instance, inputs corresponding to "3 , 2" would output bits corresponding to 6 - Start by drawing up the truth table (6 points) (show only those rows which produce a 1 in any of the output columns) Make sure you label your input and output columns correctly – everything else depends on getting the table right! - then derive the algebraic expression for the third bit of the output, Y[2] (3 points); - and simplify it (3 points) - Finally, draw the resulting circuit (3 points) (Each part is "all or nothing" - no partial credit)