$(3)(4$ pts$)$ In the network below, the bandwidth of each link is shown below:

T$-1,$ N$3,$ N$2$: $3Mbps$

T$-3,$ N$5,$ N$1,$ N$4$: $10Mbps$

When a router is connected to a link $($point to point, or broadcast link$),$ its interface has the same

bandwidth as the link's bandwidth. Assume the link metric for a $3-$Mbps link is $5,$ and the link

metric for a $10-Mbps$ link is $3.$ Use Dijkstra algorithm to find the shortest path from router D to

all the broadcast domains N$1,..,$N$5$ and the other routers in the network. $($a$)$ Show the converted

topology, as done in lecture, of the network so that you can apply the algorithm. $($b$)$ Find the

shortest distance from router D to N$2.$