If half adders and full adders are implemented using gates, then for the addition of two 17 bit numbers (using minimum gates) the number of half adders and full adders required will be
Minimum number of multiplexers required to realize the following function,f = A\'B\'C + A\'B\'C\'
Assume that inputs are available only in true form and Boolean constant 1 and 0 are available.