3. (10 points) Use Dijkstra's algorithm to find the shortest paths from the vertex V1 to all the other vertices of the graph below. Show the actions step by step by filling the table below and showing all updated values i wa0 ouhl) Length touch[i] The V1 7 V2 3 4 Final shortest path from V1 to V3 is: (list all vertex on the path) Time complexity of Dijkstra's algorithmn for graph with n vertex: Can Dijkstra's algorithm (as shown in textbook Algorithm 4.3) be used to find the shortest paths in a graph with some negative weights