Consider a Boolean function f(w, x, y, z) such that 

f(w, 0, 0, z) = 1

f(1, x, 1, z) = x + z

f(w, 1, y, z) = wz + y

The number of literals in the minimal sum-of-products expression of f is ______

Consider the following Boolean expression.

$$F = (X + Y + Z)(\overline X + Y)(\overline Y + Z)$$

Which of the following Boolean expressions is/are equivalent to $$\overline F$$ (complement of F)?

Consider the Boolean function z(a,b,c).
Which one of the following minterm lists represents the circuit given above?

Consider three 4-variable functions f₁, f₂ and f₃, which are expressed in sum-of-minterms as

f₁ = Σ(0, 2, 5, 8, 14),

f₂ = Σ(2, 3, 6, 8, 14, 15),

f₃ = Σ(2, 7, 11, 14)

For the following circuit with one AND gate and one XOR gate, the output function f can be expressed as :