In the graph below, use Dijkstra's shortest path algorithm to compute the shortest paths from vertex A to all the other vertices. Your answer will consist of the following two parts: 5 2 ☑ 7 D B 12 Part (a) Starting from vertex A, write down the order in which the vertices will be added by Dijkstra's shortest path algorithm while computing the shortest paths. Answer. Part (b) Draw the shortest path tree with vertex A as the root. The shortest path tree will consist of the edges that belong to the shortest paths from A to every other node. Answer.