Design a logic circuit to multiply two, 2-bit binary numbers together that produce a 4-bit result Y3Y2Y1Y0 . The numbers are represented by expressions A1A0 and B1B0 (A1 and B1 represent the Most Significant Bit). Perform the following steps: a) Produce a truth table for the multiplication operation.

b) Draw a K-Map for the second Least Significant Bit (Y1) of the multiplication result and produce a simplified logic expression.

c) Input the truth table prepared in part (a) using Logisim and verify that K-Map and Boolean expression you obtained part (b) matches with the one obtained using Logisim. Include the snapshot in your report