For this one question, I understand I need to use Dijkstra's Algorithm, But how to fill out this form. I'm so curious. Like the first one is a, the second one should be ac, and acb, and acbd, and then acbde, and lastly acbdez.

But how to fill out fringe list? How to draw the resulting tree???

The graph is below:

3. For the graph used in the example on page 713 (Example 2, Section 10.6) apply the algorithm I gave you to construct the shortest path tree from vertex a to all other vertices. Use the template below. STEP 11 vertices a currently 6 fringe list next edge to add Draw the resulting tree here