1. Consider the following directed graph with weights on its arcs. 2 s 1 5 5 1 5 (3 Apply Dijkstra's algorithm on the graph using the vertex S as a start vertex and fill the table below accordingly. The first row provides the distance of every vertex from S after the initialization of the algorithm. Every subsequent row in the table corresponds to the status of the algorithm after another vertex has been removed from the priority queue and the corresponding updates (to the distances) have been applied. The first column provides the vertex that has currently been removed from the priority queue. Each subsequent row corresponds to one vertex and should provide the distance of the vertex from S as currently calculated by the algorithm. The whole first row as well as the first column of the second row are provided as examples. Queue Element S 1 2 3 4 5 0 8 8 8. S