The following 3 variables are provided with minterms and dont-care terms. Any decimal value from 0 to 15 that is not listed is assumed to equal 0.

X = m (0, 2, 3, 10, 11, 14) + d(4, 5, 7, 12, 13, 15)

Y = m (0, 3, 9, 11, 14) + d(4, 5, 7, 12, 13, 15)

Z = m (1, 2, 3, 11) + d(4, 5, 7, 12, 13, 15)

For each of the 3 variables listed above, do the following:

1. Create a Karnaugh Map (K-Map) Mark the minterms with 1, dont-care terms with d, and remaining spaces with 0

2. Identify the Sum of Products (SOP)

3. Identify the Product of Sums (POS)

4. Draw a circuit using only 2-Input AND gates and 2-input OR gates

5. Draw a circuit using only 2-input NAND gates and/or NOR gates

6. Minimize either the SOP or the POS to an expression using the least amount of literals