For the relation given, do the following:

1. state whether the relation is reòexive (2 pts)
2. state whether the relation is symmetric (2 pts)
3. state whether the relation is transitive (3 pts)
if the relation is not (reflexive, symmetric, transitive), you must give a counterexample that proves it. r3 = { (0,0), (0,1), (0,2), (1,2) }

1.No

2.No

3.Transitive

Step-by-step explanation:

We are given that a relation

{(0,0),(0,1),(0,2),(1,2)}

If a relation is reflexive then (a,a) belongs to relation for each a belongs to given set.

A relation is symmetric

If (a,b) then,

A relation is transitive

(a,b) and (b,c) then, (a,c)

1.The relation is not reflexive because (1,1) does not  belongs to

2.The relation is not symmetric because (2,0)

3.It is transitive because (0,1) and (1,2) then (0,2)[tex\in R_3[/tex]

cant see photo

step-by-step explanation: