2. Using the Adjacency List below 0 1 0 2 6 2 3 + 0 + S 6 6 5 6 a) Draw directed graph b) Find its transitive closure using Boolean matrix multiplication (show all work) c) Suppose that an edge, (3,4) for example, has a cost equal to the sum of the vertex numbers. So (3,4) has a cost of 7, (1,4) has a cost of 5, and (i,j) has a cost of i+j. Determine the minimum cost of traveling from vertex #2 to vertex #3?