The document contains three questions about analyzing a graph representing unpaved roads between towns. Question 1 asks to perform DFS and BFS on the graph and show the visit order. Question 2 asks to find the minimum total length of roads that could be paved to connect all towns using Prim's and Kruskal's algorithms. Question 3 asks to find the shortest path from vertex A to all other vertices using a specific formula, and to display the results in a table and labeled diagram.

1. Provide what are being asked on the following.
The roads represented by this graph are all unpaved. The lengths of the roads
between pairs of towns are represented by edge weights.
21. Given the graph above find the visit order of DFS(G) and BFS (K).10 pts.
a. Construct the diagram
b. show the visit order of the diagram.
22. Which roads should be paved so that there is a path of paved roads
between each pair of towns so that a minimum road length is paved? 15 pts.
a. Construct MST from v1 for this graph using Prim's algorithm and solve
the to minimum cost.
b. Construct MST for this graph using Kruskal algorithm solve the to
minimum cost.
23. Determine the shortest path from vertex A to all other vertices in the
network. 15 pts.

2. a. Solve the problem using the formula D[n] = min(D[n], D[w] + C[w,n])
b. Plot the result of each iteration in a form of table.
c. Draw the diagram showing the total weight in every vertices