4. (10 points) Run Dijkstra’s Single Source Shortest Path algorithm, from vertex s, on the graph below. Show all in the vertical blanks of the table, 6ill in vertices in the order that Dijkstra’s considers them, whthe work: earliest value in the top blank. Within the table fill in the initial values, and any update that changes a value (Only fill in updates that change values.) To the right of that work, show your final tree.
OR
OR