Please help and explain why What is the simplest Boolean exp

What is the simplest Boolean expression represented by the Karnaugh map shown below? a.b + a.b.c + b.d + c.d a. b + b.c + c. d a.b.c + b.d + c.d a.b + c.d + b.d a.b.c.d + b.d + c.d

Solution

The following ia the solution:

You have to map maximum possible 1s for minimized expression.

Mapping 2 row completely we get c\'.d

Mapping four 1s in the middle we get b.d

Mapping remaining 1s will give a.b\'.c

Now add all these and answer is a.b\'.c + b.d + c\'.d