Consider the graph given above. Use Dijkstra's algorithm to find the shortest path between C and P.

a. List the vertices in the order they are visited as specified by the algorithm.

b. What is the total weight along the path?