The Boolean function is given by the minterms:
F(A,B,C,D)=∑m(0,1,2,3,8,9,10,11) Expressing the minterms in terms of their binary representations (ABCD):
m(0,1,2,3) correspond to A=0,B=0 with all combinations of C and D, which simplifies to A′B′.
m(8,9,10,11) correspond to A=1,B=0 with all combinations of C and D, which simplifies to AB′.
Combining these two sets of minterms in a 4-variable Karnaugh Map (K-map):
The octet formed by combining the first row (AB=00) and the fourth row (AB=10) covers all 8 minterms.
In these two rows, variable B remains constant at 0 (i.e., B′), while variables A, C, and D change and are eliminated.
F=A′B′+AB′=(A′+A)B′=B′ Thus, the minimal sum of products form is B′, corresponding to option (B).