Dijkstra's Algorithm. Consider the network shown below, and Dijkstra's link-state algo- rithm. Here, we are interested in computing the least cost path from node y (note: not node u!) to all other nodes using Dijkstra's algorithm. Using the algorithm statement used in the textbook and its visual representation. Also find the computed forwarding table at y. Figure 1: Network 8 12 6 9 3 8 7 4 W m m 2