Use Dijkstra's algorithm to obtain a tree of shortest paths for the graph below starting from vertex A. Select an adjacent vertex in alphabetical order.

a) Draw the shorted path edges using thick solid lines on the given graphs

b) Fill the table below:

. Vertices in the order they enter the cloud (tree of shortest paths),

. Edges in the order they enter the tree of shortest paths (only tree edges. Solid lines),

Final array with distances dist, where dist[v] shows the distance between origin (vertex A) and vertex v.

10 13 O 8 5 G