Question: Which of the following problems can be solved using a greedy algorithm?

Options:

1. Knapsack problem
2. Minimum spanning tree
3. Shortest path in a graph
4. All of the above

Correct Answer: Minimum spanning tree

Solution:

The minimum spanning tree can be solved using a greedy algorithm, while the knapsack problem is not always solvable by greedy methods.