Part I

1. Run Dijkstra algorithm on the following graph to find the shortest distance from the source vertex to all vertex. The source vertex is s. Run the algorithm step by step. (15%)