Use Dijksra's Algorithm Table to solve this question

5. Find the shortest path from node 1 to every other node in the following network. Identify the shortest path tree obtained. d dii Dijkstra's Algorithm Assuming that all arc lengths are nonnegative, the following method, known as Dijkstra's algorithm, can be used to find the shortest path from a node (say, node 1) to all other nodes.' Dijkstra's algorithm. Let u; be the shortest distance from source node 1 to node i, and define dij (20) as the length of arc (i,j). The algorithm defines the label for an imme- diately succeeding nodej as k j 1 [uj, i] = [u; + dij , i], dj = 0 i [uji] [0,-) [u;k] The label for the starting node is [0, ], indicating that the node has no predecessor. Node labels in Dijkstra's algorithm are of two types: temporary and permanent. A temporary label at a node is modified if a shorter route to the node can be found Otherwise, the temporary status is changed to permanent. Step 0. Label the source node (node 1) with the permanent label [0, ]. Set i = 1. General step i. (a) Compute the temporary labels [u; + dij, i] for each node j with dij > 0, provided j is not permanently labeled. If node j already has an existing temporary label [uj, k] via another node k and if u; + dij