A 4 \(\times\) 1 multiplexer with two selector lines is used to realize a Boolean function \( F \) having four Boolean variables X, Y, Z and W as shown below. \( S_0 \) and \( S_1 \) denote the least significant bit (LSB) and most significant bit (MSB) of the selector lines of the multiplexer respectively. \( I_0, I_1, I_2, I_3 \) are the input lines of the multiplexer. 
The canonical sum of product representation of F is
Step 1: The multiplexer configuration corresponds to the sum of minterms where the output is 1.
Step 2: After checking the input combinations, we conclude that the canonical sum of products representation is \( F(X, Y, Z, W) = \sum m(0, 1, 3, 11, 14) \).
Final Answer:
(B) \( F(X, Y, Z, W) = \sum m(0, 1, 3, 11, 14) \)



