The K-map based Boolean reduction is based on the following Unifying Theorem: A + A’ = 1.
(a) Impact
(b) Non Impact
(c) Force
(d) Complementarity
I got this question in an interview for job.
The origin of the question is Karnaugh Map in section Boolean Algebra and Minimization Techniques and Logic Gates of Digital Circuits