Table for part B: Consider a network topology with the following link cost information below:

A$.[6]$ Use Dijkstra's shortest path algorithm, construct the set of the least cost paths $($indicating the

associated path costs$)$ from $S$ to all other nodes. Show all the steps in the table given below, where $D(x)$ is

the current path cost estimate from node $S$ to node $x$ and $P(x)$ is the predecessor node to node $x$ on the

path from $S.$

B$.[6]$ Fill in the forwarding table of $S$ as given below. Identify each link using the notation $(a,b),$ where $a$ is the

starting node of the link and $b$ is the ending node of the link. For example, the link from node $S$ to node $A$

is denoted by $(S,A).$

Please click "Insert" and choose "Table" to insert a table.

Table for part A:

Table for part B: