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')' (f) a'bc + abc' + abc + a'bc' (e) (a+b+c')(a' b' + c) 2.3 2.4 Simplify the following Boolean expressions to a minimum number of literals: (a)* ABC + A'B + ABC' (b)* x'yz + xz (c)* (x + y)' (x' + y') (d)* xy + x(wz+wz') (e)* (BC' + A'D) (AB' + CD') (a' + c') (a+b' + c') Reduce the following Boolean expressions to the indicated number of literals: (a)* A'C' + ABC + AC' to three literals to three literals (b)* (x'y' + z)' + z + xy + wz )* A'B(D' + C'D) + B(A + A'CD) (d)* (A' + C) (A' + C') (A + B + C'D) (e) ABC'D+A'BD+ABCD to one literal to four literals to two literals