Please show how you did it and provide the shortest path from vertex A to each one of the vertices

Using Dykstra's algorithm, find the shortest path from vertex A to all the other vertices and provide the path For example if the shortest path from A to H was 18 the path would be A C-G H Show your work for credit