What is wrong with the following argument which purports to prove that a binary relation which is symmetric and transitive must necessarily be reflexive as well. S'poseRis a symmetric and transitive relation on the setAand leta∈AThen for anyb, with(a,b)∈Rwe have also(b,a)∈Rby symmetry. Since we now have(a,b)and(b,a)∈Rwe have(a,a)∈Ras well.(by transitivity). Thus,(a,a)∈R, soRis reflexive. 2b. Give a counter-example to disprove this statement
