Implement two bit integer multiplication with simplest circuits using Karnaugh maps. Inputs are two two-bit integers: A, B and C, D. Output is four bits that is the multiplied values: WXYZ. You could write the bits out like this: A B * C D = WXYZ For your reference, here are all the decimal values from 0 to 9 with their binary equivalents:

0000 = 0

0001 = 1

0010 = 2

0011 = 3

0100 = 4

0101 = 5

0110 = 6

0111 = 7

1000 = 8

1001 = 9

Hints: First draw out the multiplication table for two-bit multiplication. This should have 16 entries. Turns out, this is also a truth table. Lets break down one line of that table: 2 2 = 4 or in binary 10 10 = 0100 There are 4 outputs here. W is 0. X is 1. Y is 0. Z is 1. Put all the entries of W into a proper K-map, draw your circles and get the simplest circuit for W.