5. Based on the shortest path algorithm given in the text and lecture notes, present the set S of vertices whose shortest distance from source is known and the content of the table distance at each step when a remaining vertex, for which the shortest path from source has been found, is added to S. Assume that vertex 0 is the source. Note that if there is a tie, you are required to pick the vertex with the smallest label. (12 pts)