Problem
1. Give the adjacency matrix for the transitive closure of the dag in Figure 32.8.
2. What would be the result of running the transitive closure algorithms on an undirected graph that is represented with an adjacency matrix?
3. Write a program to determine the number of edges in the transitive closure of a given directed graph, using the adjacency list representation.