I dont know if these are right

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 (b) Dijkstra (c) Bellman-Ford Given the following directed weighted graph G (VE,w),indicate which shortest path algorithm is most suitable and efficient for shortest path computation on G w(1,2)-3, (13)--1, w(2,3) 2, w(2,1) 5 w(3,2)-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 suitable 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 CFor a graph G (V.E) wha is the time complexity of the DAG Shortest Paths (SP) algorithm? (a) (V) (b) 0(E) @00+ E) (d) log V) (e)0(EV) (f) e(V)