Question $3$: Consider the following network with the indicated link costs.

$($a$)(5$ Points$)$ Use Dijkstra's shortest$-$path algorithm to compute the shortest path from D to all nodes in the network. Show how the algorithm works by computing the table below $($you may expand the table as needed$).$

$\backslash$table$[[,$A$,$B$,$C$,$E$],[$step$,$N$^(\text{'}),$D$($A$),$p$($A$),$D$($B$),$p$($B$),$D$($C$),$p$($C$),$D$($E$),$p$($E$)],[0,$D$,,,,],[,,,,,]]$

$($b$)(2$ Points$)$ Based on your answer in $($a$),$ complete the forwarding table at D$,$ i$.$e$.$ show to which interface a packet must be forwarded to reach the given destinations.

$\begin{array}{cc}\text{d}\text{e}\text{s}\text{t}\text{i}\text{n}\text{a}\text{t}\text{i}\text{o}\text{n}& \text{o}\text{u}\text{t}\text{g}\text{o}\text{i}\text{n}\text{g}\text{i}\text{n}\text{t}\text{e}\text{r}\text{f}\text{a}\text{c}\text{e}\\ A& ?\\ B& ?\\ C& ?\\ E& ?\end{array}$