a) Define the transitive closure of a relation.
b) Can the transitive closure of a relation be obtained by including all pairs (a, c) such that (a, b) and (b, belong to the relation?
c) Describe two algorithms for finding the transitive closure of a relation.
d) Find the transitive closure of the relation {(1,1), (1,3), (2,1), (2,3), (2,4), (3,2), (3,4), (4,1)}.