$7.[$Link State algorithm, $\backslash (\backslash$mathbf$\{18\}\backslash$mathbf$\{$~ p t $]\}\backslash )$ Using Dijkstra's algorithm, find the least cost path from source node $\backslash ($ u $\backslash )$ to all other destinations in the network diagram below. Build a table consists of step $\backslash (0-5\backslash )($step $0$ representing initiation and each subsequent step representing a loop of the algorithm$)$ and $\backslash (\backslash$mathrm$\{$N$\}^\{\backslash$prime$\},\backslash$mathrm$\{$D$\}(\backslash$mathrm$\{$v$\}),\backslash$mathrm$\{$p$\}(\backslash$mathrm$\{$v$\})\backslash )$ in each step, as shown in the lecture slides.