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