2. Multiple Choice _ Given the following directed weighted graph G-|V,E,w). indicate and efficient for shortest path computation on G: (a) DAG Shortest Paths and efficient for shortest path computation on G: which shortest path algorithm is most suitable (b) Dijkstra (c) Bellman-Ford Given the following directed weighted graph G (V,E,w), indicate which shortest p ath algorithm is most suitable (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 su and efficient for shortest path computation on G: w(1,3)-5, w(2,3) 9, w(3,1)-2, w/(3,2)-3 (a) DAG Shortest Paths (b) Dijkstra (c) Bellman-Ford For a graph G (V.E) what is the time complexity of the DAG Shortest Paths (SP) algorithm? (a) o(v)(b) O(E) (c) o(v + E) (d)O(E log V) (e) O(EV) ( ov) For a graph G - (V,E) what is the time complexity of the Bellman-Ford SP algorithm? (c) o(V+E) (d) O(E log V) (e)O(EV) (nov) (a)orv)(b) O(E) For a graph G (V,E) what is the time complexity of the Dijkstra's SP algorithm? (a) (V) (b) (E) (c) (V + E) (d) e(E log V) (e) (EV) (f) O(Va) For a graph G (a) (V) (V,E) what is the time complexity of the Floyd-Warshall SP algorithm? (f)0(V3) (b)0(E) (c) (V + E) (d) (E log V) (e)0(EV)