little space as possible the graph has , vertices and , , edgesand it is important to use as little space as possible you need to answer the query areadjacent as fast as possibleno matter how much space you use - explain why the dfs traversal runs in ( time on an -vertex simple graph that is represented with the adjacency matrix structure - draw the transitive closure of the directed graph shown in figure - compute topological ordering for the directed graph drawn with solid edges in figure - can we use queue instead of stack as an auxiliary data structure in the topological sorting algorithm shown in code fragment why or why notr- draw simpleconnectedweighted graph with vertices and edgeseach with unique edge weights identify one vertex as "startvertex and illustrate running of dijkstra' algorithm on this graph - show how to modify the pseudo-code for dijkstra' algorithm for the case when the graph may contain parallel edges and self-loops - show how to modify the pseudo-code for dijkstra' algorithm for the case when the graph is directed and we we want to compute shortest directed paths from the source vertex to all the other vertices