(Solved) : Hello Algorithm Question Could Help Prove Dijkstra S Algorithm May Find Shortest Paths Edg Q36032962 . . . .

Hello I have an algorithm question could you help me?
Prove that Dijkstra’s algorithm may not find the shortest paths ifsome of the edge weights are negative, by giving a counterexample.So, you should give a directed graph ,and aspecified node s. You should describe theiterations of your algorithm. You shall show that for at least onenode, the path found by the algorithm is not the shortest.Make sure that your counterexample does not have anegative cost cycle. (Hint: There are very small graphs that youcan use as counterexample.)

G (V. E) Show transcribed image text

Expert Answer

An