1. (50 points) Consider the network shown below, with the indicated link costs: 12 Use Dijkstra's algorithm to compute the shortest path from x to all network nodes, and fill the table N' 2 4 Note: if the tie occurs (that is, two or more nodes are found to have the same least cost), add the node to the set N' in order oft, u, v, w, y, z. For example, if u, w, y has the same least cost, then first add u to the set N' because u is before w or y in the table