4consider Following Figure Find Shortest Distance Point Point Use Dijkstra Algorithm Bellm Q37057418

4.Consider the following figure to find the shortest distance from point A to each point. Use Dijkstra algorithm and bellman-ford algorithm to calculate respectively. Prove that using Dijkstra algorithm to get the shortest path is wrong. 12 7 2 Show transcribed image text 4.Consider the following figure to find the shortest distance from point A to each point. Use Dijkstra algorithm and bellman-ford algorithm to calculate respectively. Prove that using Dijkstra algorithm to get the shortest path is

OR

 

OR