Hello how do I solve this question? For a) please solve the question like the table shown below please. 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) Dijkstra's Algorithm Dijkstra's Algorithm: after iteration 4 L= V= C={} S={1,4,5,3,2}