I need help with question 15 from section 10.7. For question 15, you are using the graph of exercise 9 (displayed below) with a = a and z = f and using Dijkstra's algorithm to find the shortest path from a to z. Replace f with z and the points are now a ,b ,c ,d ,e, g, and z. The answer needs to be in a table format similar to Table 10.7.1 (displayed below).

Graph of exercise 9:

The textbook is Discrete Mathematics with Applications by Susanna S. Fourth Edition.

9. 4 10