1. Consider the network shown below with the link costs given. Use Dijkstras

shortest path algorithm to find the shortest paths from A to all other nodes. Show

the steps, resulting shortest path spanning tree, and the routing table.

2. Suppose we use distance vector routing to compute the next hops for the above

network. Show the resulting distance table at node A, assuming poisonous reverse is

employed.