Karnaugh Maps are useful for finding minimal implementations of Boolean expressions with only a few variables However they can be a little tricky when don t cares X are involved Using the following K Maps 8 cd ab 00 01 11 10 00 X 0 01 0 0 100 X 0 11 10 1 0 0 0 1 X 1 1 cd ab 00 01 11 10 00 1 1 0 X 11 01 X 1 0 0 0 1 X 1 10 i Find the minimal sum of products expression Show your groupings ii Find the minimal product of sums expression Show your groupings iii Are your solutions unique If not list and show the other minimal expressions MRS MSD2 1 0 0 1