Simplify these Boolean expressions from 1 to 2.   1.   AB+A(CD+CD’) 2.  AB’C+A’B’C+D’AB+DA’B+DAB

5. Draw the output X, Y and Z for the pattern of inputs shown in the figure below for three variable logical expressions: X = Not (A and B) and Not (B and C), this Boolean expression can also be depicted as X = (AB)' (BC)' %3D Y = (Not A or B) and (A and Not B), this Boolean expression can also be depicted as Y = (A'+ B) (AB') Z = (A or B) and Not (A or C), this Boolean expression can also be depicted as Z = (A+B) (A+C)' %3D A В C Y > N

Simplify the following boolean expression to minimum number of literals: a. x’yz' + x'yz + xyz + x'yz' b. (x’ + y’)( x + y ) c. (a’ + b)’(a + b’ )’

Write an expression that is a 1 when one or more of its variables (A, B, and C) are Os.