Recall that Dijkstra's algorithm is a greedy algorithm that finds the shortest paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.

Consider how the algorithm maintains and updates the tentative distances to each vertex, and how it selects the next vertex to process based on these distances.

Analyze the trace of Dijkstra's algorithm step-by-step, focusing on how the algorithm handles vertices with equal tentative distances and how it updates the distances when a shorter path is found.