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.

Answer: Option A

Explanation:

No answer description available for this question.