Revise the weighted, directed graph in Figure 29-19a by adding a directed edge from D to H. Let the weight of this new edge be 3. The resulting graph has two paths from A to H that are cheapest among...

Revise the weighted, directed graph in Figure 29-19a by adding a directed edge from D to H. Let the weight of this new edge be 3. The resulting graph has two paths from A to H that are cheapest among all paths between these two vertices. Which of these two paths will the algorithm getCheapestPath in Segment 29.24 find?