In each part the relation is given on a small finite set, with every ordered pair written out, so each of the three properties can be checked by direct inspection.
(i) Symmetric, but neither reflexive nor transitive
Take A={1,2,3} and R={(1,2),(2,1)}.
Not reflexive: 1∈A but (1,1)∈/R.
Symmetric: R has exactly two pairs. The reverse of (1,2) is (2,1), which is in R; the reverse of (2,1) is (1,2), which is in R. So R is symmetric.
Not transitive: (1,2)∈R and (2,1)∈R, so transitivity would need (1,1)∈R. It is not.
(ii) Transitive, but neither reflexive nor symmetric
Take A={1,2,3} and R={(a,b):a>b}={(2,1),(3,1),(3,2)}.
Not reflexive: (1,1)∈/R, because 1>1 is false.
Not symmetric: (2,1)∈R but (1,2)∈/R, because 1>2 is false.
Transitive: the only pair of pairs that links up is (3,2) followed by (2,1), and transitivity then needs (3,1), which is in R. In general a>b and b>c give a>c.
(iii) Reflexive and symmetric, but not transitive
Take A={1,2,3} and
R={(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)}.
Reflexive: (1,1),(2,2),(3,3) are all in R, and those are all the elements of A.
Symmetric: (1,2) pairs with (2,1), and (1,3) pairs with (3,1); each of (1,1),(2,2),(3,3) is its own reverse. Every pair of R has its reverse in R.
Not transitive: (2,1)∈R and (1,3)∈R, so transitivity would need (2,3)∈R. It is not, so R is not transitive.

(iv) Reflexive and transitive, but not symmetric
Take A={1,2,3} and R={(a,b):a≤b}={(1,1),(2,2),(3,3),(1,2),(1,3),(2,3)}.
Reflexive: a≤a for every a, so (1,1),(2,2),(3,3)∈R.
Not symmetric: (1,2)∈R but (2,1)∈/R, because 2≤1 is false.
Transitive: the chains present are (1,2) with (2,3), which needs (1,3)∈R — it is there — together with chains through the pairs (a,a), which need nothing new. In general a≤b and b≤c give a≤c.
(v) Symmetric and transitive, but not reflexive
Take A={1,2,3,4} and R={(1,1),(2,2),(1,2),(2,1)}.
Not reflexive: 3∈A but (3,3)∈/R. (Nor is (4,4).)
Symmetric: (1,2) and (2,1) are both present, and (1,1) and (2,2) are their own reverses.
Transitive: every pair of R uses only the elements 1 and 2, and all four ordered pairs built from {1,2} are in R. So whenever (a,b)∈R and (b,c)∈R, the pair (a,c) is built from 1 and 2 as well, and is therefore in R. For instance (1,2) with (2,1) needs (1,1), which is present.

A remark on two tempting "real-life" examples
Two examples often quoted here do not actually work.
-
"x is a friend of y" is claimed to be reflexive because a person is a friend of themselves. That is a convention we choose, not something the relation forces; the relation itself says nothing about it.
-
"x is a sister of y" is claimed to be transitive, and it is not. If a is a sister of b and b is a sister of a, transitivity would require a to be a sister of a, which is false.
A relation written out as a set of ordered pairs, as above, leaves nothing to interpretation.