Consider the following directed graph, G, with vertices labelled 1 to 6. G = ({1,2,3,4,5,6}, {(1,2), (1,5), (3,1), (3,4), (4,5), (5,6), (6,3)}) a. Draw graph G and give its adjacency matrix representation, labeling it Go. b. Run the Floyd-Warshall transitive closure algorithm on G, resulting in the new graph G*. Show the contents of the adjacency matrix after each iteration of the outside loop of the algorithm (that is, show Gk for each k = 1,..., 6).