I dont know if these are correct or not.

A shortest path between two vertices must contain other shortest paths within it. TA shortest path cannot contain a cycle. The time complexity of Dijkstra's algorithm is ofv2) when using an adjacency matrix, and OlE using a Min Priority Queue. F if the weight of each edge in a graph is increased by 1, the shortest paths remain the same. If the weight of each edge in a graph is multiplied by two, the shortest paths remain the sam After the third iteration of the loop in Bellman-Ford (each edge will have been relaxed 3 tim paths of length 3 will have converged to the correct distance. Shortest paths are more complex to find in a DAG because there may be maximum weight it is not possible to determine the existence of a negative net weight cycle in a graph using t Warshall algorithm. 2. Multiple Choice Given the following directed weighted graph G (V.Ew), indicate which shortest path algorithm is n and efficient for shortest path computation on G: W 1,2)--6, w(1,3)-4, w(2,3)- 2 (a) DAG Shortest Paths (b) Dijkstra (c) Bellman-Ford Civen the following directed weighted graph G-VE.w), Indicate which shortest path algorithm st and efficient for shortest path computation on G: W(12)-3, w(13)--1, w23) 2, w2.1)-5, w(3,2)--4 (b) Dijkstra (a) DAG Shortest Paths (c) Bellman-Ford Given the following directed weighted graph G r VE,w), indicate which shortest path algorithm ls 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)ev (b)(E) GovE) (d) O(E log V) (e)(EV)(0 orv') For a graph G -(V,E) what is the time complexity of the Bellman-Ford SP algorithm? (a)orv) b) olE) (c)ov+E) (d) o(E log VI e oEv)v) 2For a graph G (V,E) what is the time complexity of the Dijkstra's SP algorithm? (a) (V) (b)6(E) (c)0(V + E) (d)0(E log V) (e)0(EV) (f) (V3) For a graph G (V.E) what is the time complexity of the Floyd-Warshall SP algorithm? a) orv (b) otE) ()v+E) (d)o(E log V) (e)otEv) ov)