1)(7 pts) Use Dijkstra's algorithm to find a cheapest path from vertex P to vertex D.
Explain each step.
                                             
                                          
                                          
                                       