The set is A={−3,−2,−1,0,1,2,3}, so ∣A∣=7.
The relation R is defined by xRy⟺2x−y∈{0,1}, i.e. y=2x or y=2x−1.
Case 1: y=2x
Check each x∈A:
x−3−2−101232x−6(∈/A)−4(∈/A)−2(∈A)0(∈A)2(∈A)4(∈/A)6(∈/A)
Pairs obtained: (−1,−2),(0,0),(1,2).
Case 2: y=2x−1
Again test every x:
x−3−2−101232x−1−7(∈/A)−5(∈/A)−3(∈A)−1(∈A)1(∈A)3(∈A)5(∈/A)
Pairs obtained: (−1,−3),(0,−1),(1,1),(2,3).
Combining both cases, R contains
{(−1,−2),(−1,−3),(0,0),(0,−1),(1,2),(1,1),(2,3)}.
Number of elements in R: l=7.
Making R reflexive
A relation is reflexive when every a∈A satisfies (a,a)∈R.
Present self-pairs: (0,0),(1,1).
Missing self-pairs: (−3,−3),(−2,−2),(−1,−1),(2,2),(3,3).
Minimum additions needed: m=5.
Making R symmetric
For symmetry, whenever (a,b)∈R we also need (b,a).
List missing converse pairs:
(−1,−2)⇒(−2,−1)
(−1,−3)⇒(−3,−1)
(0,−1)⇒(−1,0)
(1,2)⇒(2,1)
(2,3)⇒(3,2)
All five are distinct and not already in R, so
minimum additions required: n=5.
Finally,
l+m+n=7+5+5=17.
Hence l+m+n=17 ⇒ Option B.