Option (A) is correct.
Explanation: From the diagram,
R={(p,1),(p,2),(q,2),(r,4),(s,1)}
so n(R)=5 and the range of R is {1,2,4}. The elements 3 and 5 of B receive no arrow.
Condition on S. The range of S must be {1,2,4}, so no pair of S may end at 3 or 5. Hence S⊂A×{1,2,4}, which has 4×3=12 pairs. Since S contains R, the range of S already contains 1, 2 and 4, so the range is exactly {1,2,4}.
So S=R∪T, where T is any subset of the 12−5=7 pairs of A×{1,2,4} that are not in R:
(q,1), (r,1), (r,2), (s,2), (p,4), (q,4), (s,4)
Each of these 7 pairs is either put in or left out, so the number of such S is 27=128.
Why the other options are wrong
- (B) 215 counts every relation that contains R: there are 20−5=15 free pairs in A×B. Many of these relations contain a pair such as (p,3), which adds 3 to the range.
- (C) 212 counts every subset of A×{1,2,4}, including sets such as ϕ that do not contain R.
- (D) 127=27−1 leaves out S=R itself. But R⊂R and R has the same range as R, so R must be counted.