Draw logic diagrams of the circuits that implement the original and simplified expressio...

Draw logic diagrams of the circuits that implement the original and simplified expressions in Problem 2.2.

Reference: Problem 2.2

Simplify the following Boolean expressions to a minimum number of literals:

(a) xy + xy ' (b) (x + y) (x + y')

(c) xyz + x ' y + xyz ' (d) (A + B)’ (A' + B’)'

(e) (a + b + c')(a' b'+ c) (f) a'bc + abc' + abc + a'bc'