CCSD Boolean Expressions & Functions Combinational Circuit Design Worksheet

I will be submitting an image of what the assignement is its only 7 questions. some are long, also posted instructions.I will be submitting an image of what the assignement is its only 7 questions. some are long, also posted instructions.I will be submitting an image of what the assignement is its only 7 questions. some are long, also posted instructions.I will be submitting an image of what the assignement is its only 7 questions. some are long, also posted instructions. PLEASE FOLLOW THE INSTRUCTIONS FROM The 2nd image.

1
(2-6. Simplify the following Boolean expressions to expressions containing a
minimum number of literals:
(a) AC + ABC + BC
(b) (A + B + C). ABC
(e) ABC + AC
(d) ABD + A CD + BD
(e) (A + B)(A + c)(ABC)
2-11. For the Boolean functions E and F, as given in the following truth table:
х Y Z
E
F
0 0 0
0
1
0 0 1
1
0
0 1 0
1
1
0 1 1
0
0
1 0 0
1
1
1 0 1
0
0
1 1 0
1
0
1 1 1
0
(a) List the minterms of each function.
(b) List the minterms of Eand F
(c) List the minterms of E + F and E. F.
(d) Express E and F in sum-of-minterms algebraic form.
(e) Simplify E and F to expressions with a minimum of literals.
(2-17.) Optimize the following Boolean functions, using a map:
(a) F(W, X, Y, Z) = m(0,1,2,4,7, 8, 10, 12)
(b) F(A, B, C, D) = m(1,4,5,6, 10, 11, 12, 13, 15)
(2-20. Optimize the following Boolean functions by finding all prime implicants and
essential prime implicants and applying the selection rule:
(a) F(A, B, C, D) = 2m (1,5, 6, 7, 11, 12, 13, 15)
(b) F(W, X, Y, Z = 2 (0, 1, 2, 3, 4, 5, 10, 11, 13, 15)
(c) F(W, X, Y, Z) = m (0, 1,2,5,7,8, 10, 12, 14, 15)
3.9.) +Design a combinational circuit that accepts a 4-bit number and generates a
3-bit binary number output that approximates the square root of the number.
For example, if the square root is 3.5 or larger, give a result of 4. If the square
root is