Q4

Study the scenario and complete the questions that follow: Consider the following weighted graph with 9 vertices and 19 edges. Note that the edge weights are distinct integers between 1 and 19. Question 4 4.1 Complete the sequence of edges in the MST in the order that Kruskal's algorithm includes them. (6 Marks) 4.2 Suppose the edge D-1 of weight w is added to the graph, for which values of w is the edge D-I in an MST? (5 Marks) 4.3 Complete the sequence of edges in the MST in the order that Prim's algorithm includes them. Start Prim's algorithm from vertex A. (6 Marks) Study the scenario and complete the questions that follow: Consider the following weighted graph with 9 vertices and 19 edges. Note that the edge weights are distinct integers between 1 and 19. Question 4 4.1 Complete the sequence of edges in the MST in the order that Kruskal's algorithm includes them. (6 Marks) 4.2 Suppose the edge D-1 of weight w is added to the graph, for which values of w is the edge D-I in an MST? (5 Marks) 4.3 Complete the sequence of edges in the MST in the order that Prim's algorithm includes them. Start Prim's algorithm from vertex A. (6 Marks)