Use Dijkstra $($link$-$state$)$ algorithm to compute the shortests paths from node A to every other node in the attached graph. You need to show your work in the form of the table like the one in Table $5\mathrm{.}1$ on page $385$ in the textbook. You also need to list all the shortest paths as a ordered list of nodes.

Please check my work and make corrections and explanations as needed.