01 8 points) Consider the following weighted directed graph: a. Find the weight of the shortest path from c to all nodes in the graph using Dijkstra’s algorithm. Complete the table that indicates intermediate values of the upper bound d of the distance from e after each iteration of the while loop. Fill in the column heading with the node that is considered at each itcration Show your work, including priority queue (with erossed-out
OR
OR