Must show all of your work otherwise no credit. 1. Prove whether the following Boolean expression is correct or not: AB = AB 2. Simplify the following Boolean expression using a map XY + + YZ + X Y Z 3. Reduce the following Boolean expression to a minimum number of literals: ABC + + ABD + BC + CD + BD 4. Find the complement of the following expression: B[(A+ CD) + D] 5. Obtain the truth table of the following function and express it in sum-of-minterms and product-of-maxterms form. (XY + Z) (Y + XZ) 6. For the Boolean function E and F, as given in the following truth table: X Y Z E F 0 0 0 1 0 0 0 1 0 1 0 1 0 1 1 0 1 1 0 0 1 0 0 1 0 1 0 1 0 0 1 1 0 1 0 1 1 1 0 1 Express E and F in sum-of-minterms algebraic form. 7. Simplify the following Boolean expression using a map X + YZ + XYZ Must show all of your work otherwise no credit. 1. Prove whether the following Boolean expression is correct or not: AB = AB 2. Simplify the following Boolean expression using a map XY + + YZ + X Y Z 3. Reduce the following Boolean expression to a minimum number of literals: ABC + + ABD + BC + CD + BD 4. Find the complement of the following expression: B[(A+ CD) + D] 5. Obtain the truth table of the following function and express it in sum-of-minterms and product-of-maxterms form. (XY + Z) (Y + XZ) 6. For the Boolean function E and F, as given in the following truth table: X Y Z E F 0 0 0 1 0 0 0 1 0 1 0 1 0 1 1 0 1 1 0 0 1 0 0 1 0 1 0 1 0 0 1 1 0 1 0 1 1 1 0 1 Express E and F in sum-of-minterms algebraic form. 7. Simplify the following Boolean expression using a map X + YZ + XYZ