Answer:
The answer is to simplify the logic diagrams.
Step-by-step explanation:
With the help of K-map, we can find the Boolean expression with the minimum number of the variables. To solve the K-map, there is no need of theorems of the Boolean algebra. There are 2 forms of the K-map - POS (Product of Sum) and SOP (Sum of Product), these forms are used according to the requirement. From these forms, the expression can be found.