2. (25) [Shortest undirected paths] Show the tracing of Dijkstras single-source shortest paths algorithm on the weighted undirected graph shown below, starting with the node s. Specifically, each time the shortest path to a new node is determined, (1) show the resulting shortest path to the node (by making the edges on the path clearly thicker and/or colored) and show inside the node the shortest distance to the node. An answer that shows only the final result will not be accepted.

21 9 25 18 12 16 12 30