1. (1 point) Recall the Dijkstra's algorithm discussed in class. At the beginning of every iteration there is a set of vertices S and among all the cut-edges, an edge (u, v) with minimum value of d(u) + Wu) is picked and at this point the value of d(v) is computed as d(u) = d(u) + Www). So in every iteration, the shortest path length from s to a new vertex is computed. For example, in the simple graph below, the sequence of vertices in which Dijkstra's algorithm computes the shortest path length is s, a, b. Consider the graph below with start nodes and answer the questions that follow: 12/ 13 160 (a) Give the sequence of vertices in which the Dijkstra's algorithm computes the shortest path length. (b) Give the shortest path lengths from s to every vertex in the graph. (c) Draw the shortest path tree given by the Dijkstra's algorithm. 1. (1 point) Recall the Dijkstra's algorithm discussed in class. At the beginning of every iteration there is a set of vertices S and among all the cut-edges, an edge (u, v) with minimum value of d(u) + Wu) is picked and at this point the value of d(v) is computed as d(u) = d(u) + Www). So in every iteration, the shortest path length from s to a new vertex is computed. For example, in the simple graph below, the sequence of vertices in which Dijkstra's algorithm computes the shortest path length is s, a, b. Consider the graph below with start nodes and answer the questions that follow: 12/ 13 160 (a) Give the sequence of vertices in which the Dijkstra's algorithm computes the shortest path length. (b) Give the shortest path lengths from s to every vertex in the graph. (c) Draw the shortest path tree given by the Dijkstra's algorithm