pls try to solve it using excel ty

Consider the fo lowing network with 12 rodes and 17 a cs. The value next to an arc corresponds to a cost value for traversing the are 10 11 10 Give the sequence of the nodes that are removed from Q Inote that the hrst node that is removed is node 1; for this network problem, the second node that is removed is noce 2. Write the node labels, e.g., 8, 11,5 . 2 2 Order of Node Removal from Q (Equ valently, the order of nodes identified as '" n the pseudocode. Node Label 1 +11 1 1 1 2 2 7 3 0 4 3 4 5 7 12 12 4 5 6 You are asked to apply Dijkstra's a gorithm to fnda least-cost path from node 1 (the source node) to every cther acde. A pseudo-code for the algorithm is as follows You are asked to apply Dijkstra's a gorithm to find a least-cost path fron node 1 (the source node) to every cther node. 7 A pseido-code for the algorithm is as follows 8 9 LC :1 1 function Dijkstra (Graph, source): create verter set 5 for each vertex v In Graph 4 dist[u] - TUFINITY 7 prev] - UNDEFINED 3 add v to o dist[source] 10 11 while is not empty 12 w - vertex in with sin dist[u] 12 1 14 resove u from 15 16 for each neighbor v of 3 13 act - dist[u] + Jonathu. 10 + alt