Apply Dijkstra's algorithm on the following graph by considering vertex '3' as the source. As per the following table, write the set of labels for each vertex, where label contains (previous vertex, distance
