Minimum number of $2 \times 1$ multiplexers required to realize the following function, $f = \overline{A} \;\overline{B} C + \overline{A}\; \overline{B} \;\overline{C}$
Assume that inputs are available only in true form and Boolean a constant $1$ and $0$ are available.
- $1$
- $2$
- $3$
- $7$