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 $4$ upon the completion of Dijkstra's algorithm from source vertex $1?$

Question $41$Select one:

a$.$

$14$

b$.$

$6$

c$.$

$7$

d$.$

$1$

e$.$

$5$

f$.$

$8$

g$.$

$12$

h$.$

$10$

i$.$

$11$

j$.$

$15$

k$.$

$9$Graph G$1$ is as follows:

Graph G$2$ is as follows.