Dijkstra's Link State Algorithm (for computing least cost paths) Consider the 6-node network shown below, with the given link costs. 9 7 9 5 3 8 9 Using Dijkstra's algorithm, find the least cost path from source node u to all other destinations. Show your work in tabular format, as in Table 4.3 in the text. Dijkstra's Link State Algorithm (for computing least cost paths) Consider the 6-node network shown below, with the given link costs. 9 7 9 5 3 8 9 Using Dijkstra's algorithm, find the least cost path from source node u to all other destinations. Show your work in tabular format, as in Table 4.3 in the text