$1.$ Consider the following network. Suppose we want to find the shortest path from node

A to all other nodes in the network using Dijkstra$$s algorithm. Fill in the table shown

below with the entries that would appear when running the Dijkstra$$s algorithm $($use the

algorithm as shown in the book$).$ Add more rows to the table if required.

$2.$ For the same network draw the Distance Vector tables as they are updated successively

when more information is available from neighbors. Only draw the tables for nodes A$,$ E$,$

and H$,$ and only show the first two rounds and then the final converged tables for these

three nodes.