Consider the network topology shown below. The topology consists of multiple routers interconnected by links. Each link has a static cost associated with it which represents the cost of sending data over that link.

$2$

$10$

$3$

$2$

Use Dijkstra's shortest$-$path algorithm to compute the shortest path from y to all network nodes. Eventually find the routing table entries at y$.$