11 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? (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? 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