Given the network below with the indicated link costs, use Dijkstra's shortest$-$path algorithm to compute the shortest path $($a$)$ from $h$ to all network nodes and list those paths, and $($b$)$ from $k$ to all network nodes and list those paths. Show how the algorithm works by computing a table similar to Table $5\mathrm{.}1.$