Dijkstra's algorithm Find the shortest paths from s to each of the other vertices in graph G2 in Figure 1 using Dijkstra's algorithm. Show the contents of the distance and predecessor arrays after each step (similar to the example in the relevant lecture slides and recorded lecture). Remember to write down the shortest path in the end. Starting point is s. 5 3 6 2 5 b G2