a$)$ Use Dijkstra's algorithm to construct a shortest path tree from vertex e$.$ Make a table in the style we've done before with Dijkstra's.

After making the table, draw the resulting shortest path tree $.$

HERE'S THE GRAPH: