Q5Single correct3 Marks13 Apr 2025Which of the following options is true?AThe minimum cost-spanning tree obtained by Prim's Algorithm is always the same as obtained by Kruskal's Algorithm.BThe minimum cost-spanning tree is not a tree.CThe cost of the spanning tree obtained by Prim's Algorithm is the same as obtained by Kruskal's Algorithm.DIf the weight of each edge in a graph is equal, then the total cost of the graph is equal to the cost of the minimum cost-spanning tree.
