Let the inputs to the 2:4 active-high decoder Q be A and B. Its outputs are:
D0=AB
D1=AB
D2=AB
The 4-to-1 multiplexer M has select lines S1 (MSB) and S0 (LSB), and data inputs:
I0=D0=AB
I3=D3=AB
The Boolean expression for output Y is:
Y=S1S0⋅I0+S1S0⋅I1+S1S0⋅I2+S1S0⋅I3 Y=S1S0(AB)+0+S1S0(1)+S1S0(AB) Now we evaluate the number of combinations of [A,B,S1,S0] that make Y=1:
Case S1S0=00: Y=AB=1⟹(A,B)=(0,0). This gives 1 combination: [0 0 0 0].
Case S1S0=01: Y=0. This gives 0 combinations.
Case S1S0=10: Y=1 regardless of A and B. This gives all 4 combinations: [0 0 1 0], [0 1 1 0], [1 0 1 0], [1 1 1 0].
Case S1S0=11: Y=AB=1⟹(A,B)=(1,1). This gives 1 combination: [1 1 1 1].
Total number of combinations producing Y=1 is 1+0+4+1=6.