2. Find the shortest path from s to all other vertices using Dijkstra's algorithm for the graph shown below. Show the sets S, V-S, and values for Short(i) for all i in V. [15 Points] A 2 2 B 2 3 4 3 3 E 3 F J 2 6 2 G 6 6 short(0) D E F A B G H I J s V-S S ABCDEFGHIJO 0 0 0 0 Step S 0 1 2 3 4 5 6 7 8 9 10 0 0 0 0 0 0