Run Dijkstra$$s algorithm on the following directed graph and show the result of

each step.

$(1)$ First, using vertex a as the source, show the shortest paths from the source

vertex to every other vertex. $(15$ points$)$

$(2)$ Then, using vertex e as the source, show the shortest paths from the source

vertex to every other vertex. $(15$ points$)$

Run Dijkstra's algorithm on the following directed graph and show the result of each step.

$(1)$ First, using vertex $\backslash ($ a $\backslash )$ as the source, show the shortest paths from the source vertex to every other vertex. $(15$ points$)$

$(2)$ Then, using vertex $\backslash ($ e $\backslash )$ as the source, show the shortest paths from the source vertex to every other vertex. $(15$ points$)$