Image text transcribed for accessibility: Consider the graph representation of a network diagram found in Figure 4. Using Dijkstra's Link State algorithm, draw a table to determine the least cost path from node A to node all other nodes. Draw the minimum spanning tree that resulted. What is the total cost for this spanning tree? Is this this minimum spanning tree unique?

Want an answer?