Question 1 (5.0 marks) Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from 0 to all network nodes. a) Show how the algorithm works by computing a table like the one discussed in class. . (4.0 marks) b) Show all the paths from A to all other network nodes. (1 mark) 8 5 1 Start 9 0 1 2 3 2 3 1 2 7