|- Given the following graph in Figure 1, find the shortest path between node G and all other nodes in the graph, using Dijkstra's algorithm. For each note, list the path and cost of the path to that node, starting at node. Please note that only correct answers will get the full 2 point. No partial points. 2 D 6 3 A E 1 1 B 4 3 5 F G 3 H 1 I Figure 1. Graph G1 Path Cost GA GB G>C G>D GE G>F GH GI G+J