Task $1$: K$-$Maps optimisation with sum or products and product of sums

$[20]$

Karnaugh $-$Maps are useful for finding minimal implementation of Boolean expressions with only a few variables. However, they can be a bit tricky when "don't cares" $($X$)$ are involved. By the K$-$maps below, perform the following tasks:

a$.$ Identify the minimal sum of products $($MSP$)$ expression. Show your groupings.

b$.$ Identify the minimal product of sum $($MPS$)$ expressions. Show your groupings.

c$.$ Are your solutions unique? If not, list and show the other minimal expressions.

d$.$ Is the MSP equivalent to the MPS$?$

$\backslash$table$[[,00,01,11,10],[00,$X$,0,0,1],[01,1,0,0,x$