Problem 2: Use Dijkstra's algorithm to find the shortest path from node a to node \\( \\mathbf{j} \\) for the network below and give the length of this path. Remember to indicate which arcs make up the shortest paths. Preserve all node labels, put newer labels to the right of earlier labels and indicate a permanent label by underlining it (see the example node below and Monday Aug 31's class). (nocle labeling example)