The first step in the greedy Activity Selection problem

Solution

• Concept: The Activity Selection Problem is a classic greedy algorithm problem where the goal is to select the maximum number of non-overlapping activities from a given set. • Explanation of Correct Answer (D): Sort by increasing order of finish times. o The greedy strategy for the Activity Selection Problem is to always pick the activity that finishes earliest among the remaining compatible activities. To implement this efficiently, the activities are first sorted by their finish times in ascending order. This allows the algorithm to iterate through the sorted activities and pick the first one that doesn't overlap with the previously selected activity, guaranteeing an optimal solution.