Consider the following shortest path problem. Which node(s) is(are) the supply node(s)?

Please give me Detailed answer

1. What is the value of ω(2, 5)? Answer: 7 2. What is the value of δ(4, 3) Answer: 7 3. What is the value of δ(6,3)? Answer: 4 4. For the following four questions, consider the single-source all-destinations shortest path with source node v_4.  Regardless of their efficiency, which algorithms can find the answer of the problem above? Choose all that apply. a. Bellman-Ford b. Dijkstra c. Floyd-Warshall  5. What is the depth of the shortest path tree? The depth is the number of edges along the longest path from the root to a leaf node. Answer:  6. What is the value of v_1∙π? Answer:  7. What is the value of v_3∙d? Answer: For the following five questions, consider Floyd-Warshall algorithm for all-pairs shortest path and answer the following questions. Type in a numeric answer. If the answer is infinity, type "inf".  8. What is the value of d^2 (v_4,v_1 )? Answer: 9. What is the value of d^5 (v_4,v_1 )? Answer: 10. What is the value of d^1 (v_5,v_4 )? Answer: 11. d^k (i,j)=δ(i,j) only if…

Using the network, solve for the following: (1) Shortest path from node A to node J; (2) Minimum spanning tree; and (3) Maximum flow from node A to node J. 7 B. (H 3. 2 3 3.