Final answer:
The question involves simplifying Boolean functions in product of sums form using Boolean algebra. For the given functions, various identities and theorems like distributive and consensus are applied for simplification.
Step-by-step explanation:
The student has asked to simplify Boolean functions in product of sums form. Simplifying Boolean expressions can be done using various identities and theorems in Boolean algebra similar to simplification in arithmetic.
Simplification of Boolean Function (a)
The function F(A,B,C,D)=A′ B′ +CD′ +ABC+A′ B′ C′ +AB′ CD can be simplified using distributive, commutative, and consensus theorems.
Simplification of Boolean Function (b)
For function F(A,B,C,D)=†(2,3,4,9,11), the minterms represented by the numbers 2, 3, 4, 9, and 11 would first need to be expressed in standard form and then simplified using Boolean algebra techniques.