We are running Dijkstra's shortest path algorithm on this graph with source vertex $0.$ We have already relaxed all outgoing edges from vertex $0.$ Which vertex does the algorithm visit next?

a$.$ Vertex $1$

b$.$Vertex $2$

c$.$Vertex $3$

d$.$Vertex $4$

e$.$Vertex $5$