Given: Relation R = {(a,a), (a.b), (b,a). (b,b). (c,c)} and Set S = {a, b, c} Complete Relation R to be Transitive with Set S

help plz i will rate you  discrete structure

. A relation R on a set S, defined as x R y if and only if y R x. This is an example of?a) reflexive relationb) symmetric relationc) transitive relationd) invalid relation

The reflexive and transitive closure of the relation A = {(0,1),(1,2)} on B = {0,1,2} is     {(0,1),(1,0),(1,2),(2,1)}     {(0,0),(1,1),(2,2)}     {(0,1), (1,2)}     {(0,1),(0,2),(1,2)}     {(0,2)}     {(0,0),(0,1),(0,2),(1,0),(1,1),(1,2),(2,0),(2,1),(2,2)}     {(0,0),(0,1),(0,2),(1,1),(1,2),(2,2)}