Discrete Mathematics

Use Dijkstra's algorithm to find the shortest path tree for the following graph. Please take the vertex s as the source. You must show detailed steps, one figure for each Initialization is given in the following graph) 10 co, nil 10 15 0, nil 10 oo, nil oo, nil oo, nil 14 d on, nil 00, ni