Question $1$ options:

Let vertex A be the source. Run Dijkstra's shortest path algorithm on the graph above.

a$)$ Give the order in which the vertices are added to the shortest path tree $(4$ points, separate the vertices by $",").$

b$)$ Give the distance of the shortest path from s to each vertex v $($in other words, the final value of d$[$v$]$ at the end of Dijkstra's shortest path algorithm, $4$ points$).$

v d$[$v$]$

$--------------$

A

B

C

D

E

F