answer the question3(the first photo) step by step and clearly

Class example dont need to answer

class example shows below

Question 3 (25.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 c to all other network nodes. (5.0 marks) - Dijkstra's Algorithm: After step 1 - L= 123456 v=2C={2,3,5,6,7}S={1,4} - Dijkstra's Algorithm: After step 2 - L=12=1= v=5C={3,5,6,7}S={1,2,4} - Dijkstra's Algorithm: After step 3 - L= v=3C={3,6,7}S={1,2,4,5}