An equivalence relation is reflexive, transitive, and symmetric.
For example, this relation is reflexive because 1R1, 2R2, 3R3, 4R4. (As can be seen by noting that .)
You can show that it is symmetric because 1R2 and 2R1, etc. ( ) Note that we need not require that 3R1 because (1, 3) is not in the set R.
I'll leave transitivity to you (that's the long one and I'm lazy. )