
Given the following directed weighted graph G-(V,E,w. indicate which shortest path algorithm is most suitable and efficient for shortest path computation on G: (a) DAG Shortest Paths and efficient for shortest path computation on G: (b) Dijkstra (c) Bellman-Ford graph G (V,E.,w), indicate which shortest path algorithm is most suitable w(1,2)-3, w(1,3)-1, w(2,3)-2, w2,1)-5, w(32)-4 (a) DAG Shortest Paths (b) Dijkstra (c) Bellman-Ford Given the following directed weighted graph G – (V,E,w), indicate which shortest path algorithm is most and efficient for shortest path computation on G: w(1,3) -5, w(2,3)-9, w(3,1)-2, w3,2)- 3 (a) DAG Shortest Paths (b) Dijkstra (c) Bellman-Ford