Which set of decision rules covers every case?

A room-entry decision depends on two conditions: Has a booking? and Has a student card? Each condition can be Yes or No, and all combinations are possible.

You are preparing a decision table with one rule for each combination. In the pairs below, the first entry answers Has a booking? and the second answers Has a student card? For example, (Yes, No) means a booking and no student card.

Which set includes every possible combination exactly once?

  1. (Yes, Yes), (Yes, No), (No, Yes), (Yes, Yes).
  2. (Yes, Yes), (Yes, No), (No, No), (No, No).
  3. (Yes, Yes), (Yes, No), (No, Yes), (No, No).
  4. (Yes, Yes), (No, Yes), (No, No), (No, Yes).