Question: Please explain step by step how to solve this question. thanks :) Consider the following network graph with given link costs. Calculate, by using Dijkstra's

Please explain step by step how to solve this question. thanks :)
Consider the following network graph with given link costs. Calculate, by using Dijkstra's algorithm, the shortest paths (the paths with least cost) from node C to all other nodes in the network. Every step in the algorithm must be shown. Use the following table template, which you copy onto your solutions sheet, and fill in
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
