Use Algorithm 1 to find the transitive closures of these relations on {a, b, c, d, e}. A) {(a, c), (b, d), (c, a), (d, b), (e, d)} b) {(b, c), (b, e), (c, e), (d, a), (e, b), (e, c)} c) {(a, b), (a, c), (a, e), (b, a), (b, c), (c, a), (c, b), (d, a), (e, d)} d) {(a, e), (b, a), (b, d), (c, d), (d, a), (d, c), (e, a), (e, b), (e, c), (e, e)}

Respuesta :

The transitive closure of {a,b,c,d,e} is option A which is {(a, c), (b, d), (c, a), (d, b), (e, d)}.

In mathematics, the transitive closure of a paired connection R on a set X is the littlest connection on X that contains R and is transitive. For limited sets, "smallest" can be taken in its standard sense, of having the least related matches; for boundless sets, it is the unique minimal transitive superset of R. Hence the transitive closure of {a,b,c,d,e} is option A which is {(a, c), (b, d), (c, a), (d, b), (e, d)}.

The reflexive closure of {a,b,c,d,e} is {(a,a),(a,e),(b,a),(b,b),(b,d),(c,c),(c,d),(d,a),(d,c),(d,d),(e,a),(e,b),(e,c),(e,e)}

as reflexive closure is the union of relation R and the identity relation on set so{ (a, a),(b,b),(c,c),(d,d),(e,e)} U {R} will result in {(a, a),(a,e),(b, a),(b,b),(b,d),(c,c),(c,d),(d, a),(d,c),(d,d),(e, a),(e,b),(e,c),(e,e)}

Symmetric closure will be the union of relation R and the inverse of relation R so the symmetric closure will be

{(a,e),(b,a),(a,b),(b,d),(d,b),(c,d),(d,c),(d,a),(a,d),(e,b),(b,e),(e,c),(c,e),(e,e)}.

To learn more about closures and their properties,

https://brainly.com/question/19340450

#SPJ4

ACCESS MORE