pls try to solve it using excel ty

Consider the following network with 12 nodes and 17 ares The value next to an are corresponds to a cost value for traversing the arc. 10 11 You are asked to apply Destras algorithm to find a least cost path from node I the source nodel to every other node. Apseudocode for the other is as follows Youred to apstra's portent to be a least cost path from ride the source model to every other node Apseudo-code for the follows . w del Here. Ostsives the current distance of cost you from the source rode (node 1) to anode lovertex) and previderches die niedote recomade in the current path from rade I to node Note that is initially the state oder in the network Nodes are coveremoved from At the end of the schon procedure Removal of snode from corresponds, innom discussions on algorithm to traves the rode permanently beled 1 + 10