Please help.

The object of this programming assignment is to read an oriented graph represented by pairs of nodes, and compute its transitive closure. as output, you are required to draw the original graph as well as its transitive closure.

please program the code for all graphs using the transitive closure. Output should be a boolean matrix

Data for the Programming assignment: Graph 1: Equivalence relation 6 12 23 31 45 56 64 Graph 2: Finer equivalence 6 12 21 34 43 56 65 Graph 3: total ordering 8 12 23 34 45 56 67 78 Graph 4: partial ordering 8 12 23 34 56 67 78 Graph 5: Universal relation 8 12 23 34 45 56 67 78 81