(a) Answer: (A) Reflexive and transitive but not symmetric.
The relation is on B={1,2,3,4,5,6}, so all three properties are tested with x,y,z taken from B.
Reflexive. Every number divides itself, so (x,x)∈R for each x∈B: the pairs (1,1),(2,2),(3,3),(4,4),(5,5),(6,6) are all present.
Transitive. Suppose y is divisible by x and z is divisible by y. Write y=kx and z=my with k,m whole numbers. Then z=m(kx)=(mk)x, so z is divisible by x and (x,z)∈R.
Not symmetric. (2,4)∈R, because 4=2×2. But (4,2)∈/R, because 2 is not a multiple of 4.
Options (B), (C) and (D) all claim R is symmetric, and the single pair (2,4) kills all three at once. (C) additionally denies reflexivity, which we have just verified.
(b) Answer: (A) 62.
A function from A to B must give each of the two players exactly one outcome. Player S can be sent to any of the 6 elements of B, and independently so can D:
6×6=62=36.
The count is ∣B∣∣A∣ — one choice from B for each member of A. The distractors come from getting that the wrong way round or from counting something else: 26=64 would be ∣A∣∣B∣, the number of functions from B to A; 6!=720 counts the orderings of B; 22=4 counts the functions from A to A.
(c) Answer: (D) None of these three.
Here R={(1,2),(2,2),(1,3),(3,4),(1,5),(4,5)}.
Not reflexive. (1,1)∈/R, so reflexivity fails immediately. (So do (3,3),(4,4),(5,5),(6,6).)
Not symmetric. (1,2)∈R but (2,1)∈/R.
Not transitive. (1,3)∈R and (3,4)∈R, but (1,4)∈/R. A second break: (3,4)∈R and (4,5)∈R, but (3,5)∈/R.

One warning about a chain that is often mistaken for a counterexample. From (1,2) and (2,2) transitivity demands (1,2) — and (1,2) is in R, so that chain closes perfectly well and proves nothing. A counterexample must end in a pair that is genuinely absent, as (1,4) is.
Since all three properties fail, the answer is (D).
(d) Answer: (D) 212.
A relation from A to B is any subset of A×B, and
∣A×B∣=∣A∣×∣B∣=2×6=12.
Building a subset means deciding, independently for each of those 12 pairs, whether to keep it or drop it — 2 choices, twelve times:
212=4096.
Among the distractors, 62 is the count of functions from A to B (part (b)) — the commonest slip here is to confuse relations with functions; 26 is the number of subsets of B alone; 6! is the number of orderings of B.
(e) Answer: (B) Reflexive and transitive.
Here R={(1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(1,2),(4,5),(5,6),(4,6)}.
Reflexive. All six pairs (1,1) through (6,6) are present, so (x,x)∈R for every x∈B.
Not symmetric. (1,2)∈R but (2,1)∈/R. This one fact rules out (A), (C) and (D), since each of them claims symmetry.
Transitive. Only four pairs have unequal entries: (1,2), (4,5), (5,6) and (4,6). Every chain of two pairs must be checked.
| First pair | Second pair | Pair transitivity demands | Present? |
|---|
| (1,1) | (1,2) | (1,2) | Yes |
| (1,2) | (2,2) | (1,2) | Yes |
| (4,4) | (4,5) | (4,5) | Yes |
| (4,5) | (5,5) | (4,5) | Yes |
| (4,5) | (5,6) | (4,6) | Yes |
| (4,4) | (4,6) | (4,6) | Yes |
| (4,6) | (6,6) | (4,6) | Yes |
| (5,5) | (5,6) | (5,6) | Yes |
| (5,6) | (6,6) | (5,6) | Yes |
No chain fails, so R is transitive. The pair that does the work is (4,6): without it the chain 4→5→6 would have no shortcut and transitivity would break.

R is reflexive and transitive but not symmetric, so it is not an equivalence relation either. The answer is (B).