Question 4: In order to cover the graph from Figure 1, the depth-first search algorithm was used. The starting vertex is 2. What is the traversal order determined by the depth-first search algorithm? (1 pct) Question 5: For the graph from Figure 1, what edges are part of the minimum spanning tree (the direction of the edges is ignored)? What will be the total cost of the tree? (1.5 pct) Question 6: What is the adjacency matrix for the graph from Figure 1? (1 pct) Figure 1 Question 1: In the graph from Figure 1, identify the shortest path with the minimum cost to reach vertex 7 if the source vertex is 6. What is the cost of the path? Question 7: Give two examples of graph algorithms that use the greedy method and two examples that use the dynamic programming approach, from the algorithms we learnt in this semester. (1 pct) (1 pct) Question 2: In order to discover the shortest path from source vertex 6 to vertex 7, Dijkstra's algorithm was used to the graph from Figure 1. For the first 5 steps of Dijkstra's algorithm, what values will the d vector store? Question 8: For the graph from Figure 1, give example of a topological sorting. ove 5) and (2, 3) from the me graph and give another example of a topological sorting. (1 pct) The d vector stores the distance between the source node and all vertices in the graph. Each step removes one node from the queue and places it in the stack. (2.5 pct -0.5 pct for each correct step) Question 3: In order to cover the graph from Figure 1, the breadth-first search algorithm was used. The starting vertex is 1. What is the traversal order determined by the breadth-first search algorithm? (1 pct)