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.$

Upon the completion of Dijkstra's algorithm from source vertex $1,$ which of the following vertices will be the parent of vertex $2$ in the resulting shortest path tree?

Question $42$Select one:

a$.$

$3$

b$.$

$5$

c$.$

$1$

d$.$

$4$

e$.$

$6$