What if in addition to the conditions from part $($b$),$ you are guaranteed that there are no edges leaving target t$.$ What will happen if we run Dijkstra$$s algorithm on this graph? Will it succeed or might it fail? Why? $($Assume that we don$$t care about getting the correct distances to other nodes, just

t$).$