8 4 14 10 2 Figure 2: Directed graph for computing Shortest Path 3. Dijkstra's algorithm for computing a shortest path starts with a given vertex and traverse a set of vertices that until a given destination node is reached. Show the action of Dijkstra's Shortest path algorithm on the graph in Figure 2 with starting node b and destination node i. Use illustrations similar to the book