Show that in Dijkstra’s algorithm, for Lk there is a

Show that in Dijkstra’s algorithm, for Lk there is a path P: 1 → k of length Lk.

PROBLEM SET 23.3: