The relation corresponds to $x \equiv y \pmod 3$, which is a known equivalence relation (Reflexive, Symmetric, Transitive). Statement II is correct.
To find $n(R)$, we group elements by their remainder modulo 3:
$C_0 = \{0, 3, 6, 9\}$ (4 elements).
$C_1 = \{1, 4, 7\}$ (3 elements).
$C_2 = \{2, 5, 8\}$ (3 elements).
Pairs in R are formed by taking any two elements (including same) from the same group.
$n(R) = |C_0|^2 + |C_1|^2 + |C_2|^2$.
$n(R) = 4^2 + 3^2 + 3^2 = 16 + 9 + 9 = 34$.
Statement I says 36, so it is incorrect.