Multiple choice Which of the following algorithms solves the minimum weight spanning tree problem? Greedy Depth-first Search Dynamic Programming Divide & Conquer Reveal answer Fill a bubble to check yourself A Correct answer Explanation Algorithms like Kruskal's and Prim's find the minimum weight spanning tree by making locally optimal choices at each step, which is the defining characteristic of greedy algorithms.