1)(7 pts) Use Dijkstra's algorithm to find a cheapest path from vertex P to vertex D.
Explain each step.
![17 pts Use Dijkstras algorithm to find a cheapest path from vertex P to vertex D Explain each step class=](https://us-static.z-dn.net/files/dec/e86e21f999043c81bef7f8ab7e2fd8c5.png)