In your textbook: Exercise 2.1, consider the truth tables in a,b and c only: 1. Give the Boolean expression in the Sum-of-Product (SOP) in canonical minterms form. 2. Repeat in the Product-of-Sum (POS) in the canonical maxterms form. 3. Using K-map for truth tables a,b and c in exercise 2.1, give the minimized circuit in SOP 4. Consider the following Boolean expression: H(x,y,z)=xyz+xyz+xyz a. Simplify the expression and give H in SOP b. Give the circuit implementation of the simplified expression in (a) using NAND gates only 5. Consider the following expression F(a,b,c)=(a+ab)(bc+ac)a a. Give the simplified in SOP b. Give the implementation in part a using NOR gates only. In your textbook: Exercise 2.1, consider the truth tables in a,b and c only: 1. Give the Boolean expression in the Sum-of-Product (SOP) in canonical minterms form. 2. Repeat in the Product-of-Sum (POS) in the canonical maxterms form. 3. Using K-map for truth tables a,b and c in exercise 2.1, give the minimized circuit in SOP 4. Consider the following Boolean expression: H(x,y,z)=xyz+xyz+xyz a. Simplify the expression and give H in SOP b. Give the circuit implementation of the simplified expression in (a) using NAND gates only 5. Consider the following expression F(a,b,c)=(a+ab)(bc+ac)a a. Give the simplified in SOP b. Give the implementation in part a using NOR gates only