3. The directed graph for the relation R is:
R is reflexive, since there is a loop at each vertex.
R is symmetric, since whenever the directed edge (u, v) is in the graph, so is the
directed edge (v, u).
R is transitive, since whenever the directed edges (u, v) and (v, w) are in the graph, so
is the directed edge (u, w).