Problem $3$: Name:

The following is a network with $8$ routers $($Router A$,$ B$,$ C$,$ D$,$ E$,$ F$,$ G$,$ and H$).$ The

costs of transmitting packets over links in both directions between routers are shown

in the figure. Using the Bellman$-$Ford shortest path routing algorithm show the

computation of the shortest path costs from ALL routers to the destination Router $H$

$($Show ALL steps of the process as information progresses in the network$).$