Find the complement of the Boolean function F = A ′ B C ′ + A ′ B ′ C .

e. Derive the minimal Boolean expression using Boolean algebraic techniques and draw the gate diagram for the canonical representation of the following truth table X 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 Z 0 1 0 1 0 1 0 1 OUT 0 0 0 1 0 1 1 1

1. Simplify the following Boolean expressions to a minimumnumber of literals: a. xy + xy ′ b. ( x + y ) ( x + y ′ ) c. xyz + x ′ y + xyz ′ d. ( x + y ) ′ ( x ′ + y ′ ) ′

Given the function, F (x, y, z) = y(x′z + xz′) + x(yz + yz′) Q.Simplify the expression using Boolean algebra and identities