Consider the directed graph below. Simulate Dijkstra's algorithm (in the way same as in the homework) so as to find, for each node v, the length of the shortest path from s to v. [20 points] step 0 1 2 3 4 5 6 3 8 d action. add node s add node d add node. add node add node add node - 10 3 5 S {} {s} {s, d} {s, d, } {s, d, } -} {s, d, {s, d, b 0 0 T[S] Tb TC [d] [e] 0 0 0 0 0 5 0 8 - - - - - 8 - - - - - 5 - 8 3 32 3 3 3 3 - - T 8 I