Assume we have a graph, G, and that in G there is NO path from vertex 5 to vertex 3. At the end of running Dijkstra's algorithm starting from vertex 5, p[3] will be
What is the value of p[3] ?