Option (B) is correct.
Explanation:
Let the domain be {g1,g2} and the range be {t1,t2,t3}. Every pair of R has its first component in the domain and its second in the range, so
R⊂{g1,g2}×{t1,t2,t3}
Greatest: this product has 2×3=6 pairs, and R equal to the whole product has the right domain and range. So the greatest value is 6.
Least: each of the 3 tables is in the range, so each needs at least one pair of its own. Hence n(R)≥3. The value 3 is reached, for example by
R={(g1,t1),(g1,t2),(g2,t3)}
whose domain is {g1,g2} and range is {t1,t2,t3}. So the answer is (3,6).
Why the other options are wrong
- (A) A least value of 2 would need 3 tables to be covered by only 2 pairs. Each pair has one second component, so 2 pairs give at most 2 tables in the range.
- (C) 64=26 is the number of relations from a 2-element set to a 3-element set, not the number of pairs in one relation. One relation has at most 2×3=6 pairs.
- (D) A least value of 5=2+3 assumes each guest and each table needs a separate pair. One pair covers a guest and a table at the same time, so 3 pairs are enough.