How would we solve this using Dijkstra's Algorithm?

You can ignore the handwriting on top of the nodes.

a. For the following directed graph, use Dijkstra's algorithm to find the shortest path from source to each of the rest of the vertices. The initialization is given below. In the table, show d(v) and ?(v) at the end of each step. (in the table, if the cost of a node is", leave the cell blank. If the predecessor of a node is nil, leave the cell blank.) 1. 7 2- 6 Initialize dv) nil tv) Step 2 Step 3 Step 4 dv) tv) d(v) t(v) Step 5 dv) b. Draw the resulting tree on the figure. c. What is the running time of Dijkstra's algorithm