8.  How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z)
A.1
B.2
C.4
D.5

---

9. What is the primary motivation for using Boolean algebra to simplify logic expressions?
A.It may make it easier to understand the overall function of the circuit.
B.It may reduce the number of gat
C.It may reduce the number of inputs requir
D.all of the above

---

10.  How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z)
A.1
B.2
C.4
D.5

---

11. Which Boolean algebra property allows us to group operands in an expression in any order without affecting the results of the operation [for example, A + B = B + A]
A.associative
B.commutative
C.Boolean
D.distributive

---

12. When grouping cells within a K-map, the cells must be combined in groups of ________.
A.2s
B.1, 2, 4, 8, etc.
C.4s
D.3s

---

13. Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.
A.F = ABD + ABC + CD
B.F = CD + AD
C.F = BC + AB
D.F = AC + AD

---

14. Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as a BCD-to-decimal converter. These result in ________terms in the K-map and can be treated as either ________ or ________, in order to ________ the resulting term.
A.don't care, 1s, 0s, simplify
B.spurious, ANDs, ORs, eliminate
C.duplicate, 1s, 0s, verify
D.spurious, 1s, 0s, simplify

---