please be clear

Apply the solution to the phone number

Data : In this problem, we will studied a graph as mentioned bellow. This graph contains 6 nodes and 10 ares. The missed 8 numerical value of the are characteristic (Distance or Capacity) corresponds to the rest of your phone number, as missioned in the following Table. If the number is 0 , so the corresponding value is 10 . Write the numerical values of all Vi in the graph This problem contains three questions. You should detail all algorithm iterations 1) Applying a Minimal Spanning Tree algorithm to the corresponding undirected graph (You can use Prim's Algorithm or Kruskal's Algorithm) 2) Applying Dijkstra's algorithm to find 2.1) the shortest route between A and F. 2.2) the shortest route between A and D. 3) Applying the Ford-Fulkerson algorithm for Maximum Flow Problem. In this case, the node A is considered as the source, the node F is the sink, and each Xi as the capacity of the arc