A network topology with link cost is represented by a matrix…
A network topology with link cost is represented by a matrix shown in Table 3. Table 3.jpg Run Dijkstras algorithm on the network to determine the routing table for Node C. Assume that Dijkstras algorithm gives priority to paths with fewer hops, when choosing between paths of the same overall cost. The routing table consists of 3 columns: the destionation node, the next-hop node, and the overall cost to reach from node C to the destination node. Please show all intermediate steps.