Problem $1(30$ pts$)$ Consider te following network, where nodes are Routers and each link is associated

with cost.

a$)$ Complete the Dijkstra's table from node A to all network nodes, using Dijkstra's algorithm.

b$)$ Compute the shortest path from node $A$ to other nodes in the network.