Prim’s Algorithm for finding the Minimum Spanning Tree of a graph is a kind of a _______ans.greedy methoddivide and conquer methodback tracking methodforward method Previous Marked for Review Save & Finish

Prim’s Algorithm for finding the Minimum Spanning Tree of a graph is a kind of a greedy method.

Here's a step by step explanation:

1. Prim's algorithm is a type of greedy algorithm. A greedy algorithm is an algorithmic paradigm that follows the problem-solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum.

2. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex.

3. The goal of the algorithm is to find the subset of edges that connects all the vertices in the graph and has the minimum total weight.

4. The algorithm starts with an empty graph and keeps adding edges which connect the two sets (the set of vertices already included and the set of vertices not included) and has minimum weight till all the vertices are included in the first set.

5. The algorithm is greedy because at each step it chooses the edge that has the least weight among all edges. It doesn't look ahead to decide which edge will be the best in the future, it just considers the current situation.

So, Prim’s Algorithm for finding the Minimum Spanning Tree of a graph is a kind of a greedy method.