(Boolean Simplification) Use express to simplify the following functions in sum of products form. How many literals appear in your minimized solutions? a. f(X, Y, Z) = Product M(0, 1, 6, 7) b. f(W, X, Y, Z) = Product m(1, 3, 7, 9, 11, 15) c. F(V, W, X, Y, Z) = Product (1, 3, 7, 9, 11, 15) c. f(V, W, X, Y, Z) = Product M(0, 4, 18, 19, 22, 23, 25, 29) d. f(A, B, C, D) = sigma m(0, 2, 4, 6) (AND.OR/NAND.NAND Mappings) Draw schematics for the following expressions, mapped into NAND only networks. You may assume that literals and their complements are available. a. F(A, B, C) = AB + AC b. F(A, B, C) = AB + AC c. F(A, B, C, D) = (A + B) ACD d. F(A, B, C, D) = (A + B) + (A + C) (OR-AND/NOR-NOR Mappings) Draw schematics for the following expressions, mapped into NOR-only networks. You may assume that literals and their complements are available. a. F(A, B, C) = (A + B + C)(A + C)(A + B) b. F(A, B, C) = ABC + AB + AC c. F(A, B, C, D) = (A + B) ACD (Hazard-Free Design) Implement the following Boolean functions using hazard-free circuits For each problem remove all static-1 hazards. Then repeat the problem removing all static-0 hazards. a. F(A, B, C) = AB + AC b. F(A, B, C, D) = sigma m(0, 5, 7, 8, 10, 11, 12, 14) c. F(A, B, C) = (A + B)(A + C) d. F(A, B, C, D) = Product M(2, 3, 5, 8, 9, 11, 12, 13, 15)