Minimum number of 2 x 1 multiplexers required to realize the following function, f = A'BC + AB'C + AB'C' + ABC'. Assume that inputs are available only in true form and Boolean a constant 1 and 0 are available.
- A. 1
- B. 2
- C. 3
- D. 7
Answer: B. 2
Explanation: The function simplifies. f = A'BC + A(B'C + B'C' + BC') = A'BC + A(B'(C+C') + BC') = A'BC + A(B' + BC') = A'BC + A(B' + C') = A'BC + AB' + AC'. This can be implemented with 2 MUXes.