2. Design a 2-bit unsigned binary multiplier. The multiplier takes two 2-bit inputs, A[1:0] and B[1:0], and produces an n-bit output Y which corres[ponds to the product of the two inputs when treated as 2-bit unsigned numbers:

Y[n-1:0] = A[1:0] * B[1:0]

a. (8 points) Construct the complete truth table for this circuit. Show all outputs as separate o/p columns in a single table.

b. (17 points) Extract the algebraic equation for bit 1 of the output, simplify it to the extent possible, and construct the logic circuit that it corresponds to.