Repeat Problem 2.35 for the case where f should be 1 only if X ≥ Y. 

(a) Show the truth table for f.
(b) Show the canonical sum-of-products expression for f.
(c) Show the simplest possible sum-of-products expression for f.

Data From Problem 2.35

Design a circuit with output f and inputs x₁, x₀, y₁, and y₀. Let X = x₁x₀ and Y = y₁y₀ represent two 2-digit binary numbers. The output f should be 1 if the numbers represented by X and Y are equal. Otherwise, f should be 0.

(a) Show the truth table for f.
(b) Synthesize the simplest possible product-of-sums expression for f.