Help please , with the table drawn out thank you

Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from A to all network nodes. a) Show how the algorithm works by computing a table like the one discussed in class. (20.0 marks) b) Show all the paths from A to all other network nodes. (5.0 marks) Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from A to all network nodes. a) Show how the algorithm works by computing a table like the one discussed in class. (20.0 marks) b) Show all the paths from A to all other network nodes. (5.0 marks)