Consider the networking of routers shown below, with the $$link weight$$ for each link written next to the link:

Use Dijkstra$$s shortest$-$path algorithm to compute the shortest path from A to all other routers. Show how the algorithm works by filling out the table below, showing both the current cost to each destination $($D$($X$))$ and the corresponding shortest path $($p$($X$)).\backslash$table$[[$Step$,S,D(B),p(B),D(C),p(C),D(D),p(D),D(E),p(E),D(F),p(F),D(G),p(G),D(H),p(H)$