Let `A = {1, 2, 3}`. Then number of equivalence relations containing (1, 2) is (A) 1 (B) 2 (C) 3 (D) 4

Let A={1,\ 2,\ 3} . Then, the number of equivalence relations containing (1, 2) is (a) 1 (b) 2 (c) 3 (d) 4

Let A = {1, 2, 3}, then the number of equivalence relations containing (1,2) is (a) 1 (b) 2 (c) 3 (d) 4 .

Let A (1,2,3). Then, find the number of equivalence relations containing (1,2).

Let A = { 1,3,5 } . then the number of equivalence relations in A containing (1,3) is ?

If A={1,3,5} , then the number of equivalence relations on A containing (1,3) is

If A={1,2,3} then the maximum number of equivalence relations on A is

Let A = {1, 2, 3} Then number of relations containing (1, 2) a n d (1, 3) which are reflexive and symmetric but not transitive is (A) 1 (B) 2 (C) 3 (D) 4