In the $$4 \times 1$$ multiplexer, the output $$F$$ is given by $$F = A \oplus B.$$ Find the required input $${{\rm I}_3}{{\rm I}_2}{{\rm I}_1}{{\rm I}_0}.$$

The output $$Y$$ of a $$2$$ $$-$$ bit comparator is logic $$1$$ whenever the $$2$$-bit input $$A$$ is greater than the $$2$$-bit input $$B.$$ The number of combination for which the output is logic $$1$$, is

The output $$Y$$ of the logic circuit given below is

Figure shows a $$4$$ to $$1$$ $$MUX$$ to be used to implement the sum $$S$$ of a $$1$$-bit full adder with input bits $$P$$ and $$Q$$ and the carry input $${C_{in}}.$$ Which of the following combinations of inputs to $${{\rm I}_0},\,\,{{\rm I}_1},\,\,{{\rm I}_2}$$ and $$\,\,{{\rm I}_3}$$ of the $$MUX$$ will realize the sum $$S$$?