Refer to graph G$1$ from the uploaded reference graphs here.

Consider running Dijkstra's shortest path algorithm upon graph G$1$ from source vertex $1.$

Which of the following will be the distance estimate for vertex $6$ upon the completion of Dijkstra's algorithm from source vertex $1?$

Question $45$Select one:

a$.$

$7$

b$.$

$14$

c$.$

$1$

d$.$

$4$

e$.$

$9$

f$.$

$15$

g$.$

$10$

h$.$

$11$