Let A = {1, 2, 3}.
A relation R on A is defined as R = {(1, 2), (2, 1)}.
It is clear that (1, 1), (2, 2), (3, 3) ∉ R.
∴ R is not reflexive.
Now, as (1, 2) ∈ R and (2, 1) ∈ R, then R is symmetric.
Now, (1, 2) and (2, 1) ∈ R
However, (1, 1) ∉ R
∴ R is not transitive.
Hence, R is symmetric but neither reflexive nor transitive