Each “1” entry in a K-map square represents _______________

• A. A HIGH for each input truth table condition that produces a HIGH output
• B. A HIGH output on the truth table for all LOW input combinations
• C. A LOW output for all possible HIGH input conditions
• D. A DON’T CARE condition for all possible input truth table combinations