Question $2$:

There is a network as shown above, consisting of eight nodes $($labeled A through $H),$ and the

diagram indicates the costs associated with the links between neighboring nodes. a$)$ Use Dijkstra's link$-$state routing algorithm to determine the shortest paths from node

A to all other nodes $(10$ points$)$ and complete the routing table for node $A$ as follows

$(10$ points$).$

b$)$ Use Dijkstra's link$-$state routing algorithm to determine the shortest paths from node

$E$ to all other nodes $(10$ points$)$ and complete the routing table for node $E$ as follows

$(10$ points$).$

Note: You should show Dijkstra's table$($page $14$ of chapter $5).$ You can draw it through any

tool such as Microsoft Office tools or draw it on paper and attach its image.

Hint: "Next Hop" referes to next router $($first hop router$)$ in the path between that router

and destination. For instance, if node A wants to send a packet to destination $G,$ this packet

should be forwarded to node C first, so C will be the next Hop. "Overall cost" refers to the

total cost from the source to the destination.