Dijkstra's shortest path algorithm is run on the graph, starting at vertex C. Each row in the table below represents one iteration of the while loop in Dijkstra's algorithm. When a vertex is dequeued, 0 or more adjacent vertices' distances are updated. Complete the table. Enter updated vertices as A, B, C or "none" if no adjacent vertices are updated. 1 D 2 B 6 3 9 E 00 8 C 5 A Iteration Vertex dequeued Adjacent vertices updated Ex: C Ex: A, B, C or none 1 2 3 4 5